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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:13:25,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:13:25,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:13:25,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:13:25,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:13:25,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:13:25,396 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:13:25,398 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:13:25,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:13:25,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:13:25,412 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:13:25,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:13:25,413 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:13:25,414 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:13:25,415 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:13:25,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:13:25,421 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:13:25,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:13:25,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:13:25,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:13:25,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:13:25,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:13:25,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:13:25,443 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:13:25,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:13:25,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:13:25,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:13:25,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:13:25,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:13:25,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:13:25,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:13:25,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:13:25,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:13:25,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:13:25,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:13:25,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:13:25,458 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-10 10:13:25,487 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:13:25,488 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:13:25,489 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:13:25,489 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:13:25,489 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:13:25,490 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:13:25,490 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:13:25,490 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:13:25,490 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:13:25,491 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:13:25,491 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:13:25,491 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:13:25,492 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:13:25,492 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:13:25,492 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:13:25,492 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:13:25,493 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:13:25,494 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:13:25,494 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:13:25,494 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:13:25,494 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:13:25,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:13:25,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:13:25,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:13:25,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:13:25,495 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:13:25,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:13:25,496 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:13:25,496 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:13:25,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:13:25,496 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:13:25,497 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:13:25,497 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:13:25,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:13:25,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:13:25,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:13:25,588 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:13:25,588 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:13:25,589 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-09-10 10:13:25,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b3f1b88/a11a1fae25284b32a7c1c89fa54f83ca/FLAG4592deddd [2018-09-10 10:13:26,107 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:13:26,108 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-09-10 10:13:26,114 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b3f1b88/a11a1fae25284b32a7c1c89fa54f83ca/FLAG4592deddd [2018-09-10 10:13:26,128 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b3f1b88/a11a1fae25284b32a7c1c89fa54f83ca [2018-09-10 10:13:26,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:13:26,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:13:26,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:13:26,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:13:26,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:13:26,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3231cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26, skipping insertion in model container [2018-09-10 10:13:26,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,300 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:13:26,339 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:13:26,356 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:13:26,361 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:13:26,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26 WrapperNode [2018-09-10 10:13:26,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:13:26,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:13:26,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:13:26,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:13:26,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:13:26,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:13:26,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:13:26,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:13:26,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (1/1) ... [2018-09-10 10:13:26,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:13:26,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:13:26,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:13:26,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:13:26,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (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-09-10 10:13:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:13:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:13:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assert [2018-09-10 10:13:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assert [2018-09-10 10:13:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:13:26,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:13:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:13:26,486 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:13:26,747 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:13:26,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:13:26 BoogieIcfgContainer [2018-09-10 10:13:26,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:13:26,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:13:26,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:13:26,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:13:26,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:13:26" (1/3) ... [2018-09-10 10:13:26,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725eb1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:13:26, skipping insertion in model container [2018-09-10 10:13:26,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:13:26" (2/3) ... [2018-09-10 10:13:26,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725eb1b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:13:26, skipping insertion in model container [2018-09-10 10:13:26,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:13:26" (3/3) ... [2018-09-10 10:13:26,756 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-09-10 10:13:26,766 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:13:26,774 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:13:26,816 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:13:26,817 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:13:26,817 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:13:26,817 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:13:26,817 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:13:26,817 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:13:26,818 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:13:26,818 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:13:26,818 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:13:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-09-10 10:13:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-10 10:13:26,841 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:26,842 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:26,843 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash -725873037, now seen corresponding path program 1 times [2018-09-10 10:13:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:26,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:26,903 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:26,959 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:13:26,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-10 10:13:26,959 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-10 10:13:26,976 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-10 10:13:26,976 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:13:26,979 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-09-10 10:13:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:27,004 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-09-10 10:13:27,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-10 10:13:27,005 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-09-10 10:13:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:27,016 INFO L225 Difference]: With dead ends: 38 [2018-09-10 10:13:27,016 INFO L226 Difference]: Without dead ends: 19 [2018-09-10 10:13:27,022 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-09-10 10:13:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-10 10:13:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-10 10:13:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-10 10:13:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-10 10:13:27,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-09-10 10:13:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:27,056 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-10 10:13:27,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-10 10:13:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-10 10:13:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-10 10:13:27,058 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:27,058 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:27,058 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:27,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1889590996, now seen corresponding path program 1 times [2018-09-10 10:13:27,059 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:27,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:27,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:27,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:27,061 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:27,232 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:13:27,232 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:13:27,232 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:13:27,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:13:27,234 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:13:27,235 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:13:27,235 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-09-10 10:13:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:27,382 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-09-10 10:13:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:13:27,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-09-10 10:13:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:27,387 INFO L225 Difference]: With dead ends: 37 [2018-09-10 10:13:27,387 INFO L226 Difference]: Without dead ends: 26 [2018-09-10 10:13:27,389 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:13:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-10 10:13:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-09-10 10:13:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-10 10:13:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-10 10:13:27,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-09-10 10:13:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:27,401 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-10 10:13:27,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:13:27,401 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-10 10:13:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-10 10:13:27,402 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:27,402 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:27,403 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:27,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1455859095, now seen corresponding path program 1 times [2018-09-10 10:13:27,403 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:27,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:27,405 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:27,665 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:27,665 INFO L197 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-09-10 10:13:27,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:27,684 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:27,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:27,794 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-09-10 10:13:27,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:27,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:27,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:13:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:28,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:28,524 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-09-10 10:13:28,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:28,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:28,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-09-10 10:13:29,627 WARN L175 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:13:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:29,655 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:29,656 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:13:29,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:29,672 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:29,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:29,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:30,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:13:30,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 4, 4] total 15 [2018-09-10 10:13:30,958 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:13:30,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:13:30,959 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:13:30,960 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=165, Unknown=1, NotChecked=0, Total=210 [2018-09-10 10:13:30,960 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-09-10 10:13:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:31,345 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-09-10 10:13:31,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-10 10:13:31,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-09-10 10:13:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:31,348 INFO L225 Difference]: With dead ends: 48 [2018-09-10 10:13:31,348 INFO L226 Difference]: Without dead ends: 37 [2018-09-10 10:13:31,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=57, Invalid=214, Unknown=1, NotChecked=0, Total=272 [2018-09-10 10:13:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-10 10:13:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-09-10 10:13:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-10 10:13:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-10 10:13:31,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 17 [2018-09-10 10:13:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:31,360 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-10 10:13:31,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:13:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-10 10:13:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-10 10:13:31,361 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:31,362 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:31,362 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash -231976065, now seen corresponding path program 1 times [2018-09-10 10:13:31,362 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:31,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:31,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:31,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:31,364 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-10 10:13:31,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:31,640 INFO L197 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-09-10 10:13:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:31,663 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:31,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:31,759 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-09-10 10:13:31,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:31,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:31,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:13:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:32,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:32,647 WARN L175 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-09-10 10:13:32,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-09-10 10:13:32,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:32,667 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 14 treesize of output 12 [2018-09-10 10:13:32,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:32,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:32,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-09-10 10:13:33,026 WARN L175 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:13:33,836 WARN L175 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:13:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:33,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:33,868 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:13:33,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:33,895 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:13:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:33,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-10 10:13:33,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-10 10:13:36,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:13:36,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11, 5, 5] total 24 [2018-09-10 10:13:36,195 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:13:36,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:13:36,196 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:13:36,196 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=455, Unknown=3, NotChecked=0, Total=552 [2018-09-10 10:13:36,197 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2018-09-10 10:13:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:36,652 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-09-10 10:13:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-10 10:13:36,652 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-09-10 10:13:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:36,654 INFO L225 Difference]: With dead ends: 66 [2018-09-10 10:13:36,655 INFO L226 Difference]: Without dead ends: 48 [2018-09-10 10:13:36,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=128, Invalid=625, Unknown=3, NotChecked=0, Total=756 [2018-09-10 10:13:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-10 10:13:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-09-10 10:13:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-10 10:13:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-09-10 10:13:36,667 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 28 [2018-09-10 10:13:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:36,667 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-09-10 10:13:36,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:13:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-09-10 10:13:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-10 10:13:36,669 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:36,669 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:36,669 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash -547673459, now seen corresponding path program 2 times [2018-09-10 10:13:36,670 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:36,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:36,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:13:36,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:36,671 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:13:36,826 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:36,826 INFO L197 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-09-10 10:13:36,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:13:36,846 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:13:36,895 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:13:36,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:36,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:36,931 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-09-10 10:13:36,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:36,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:36,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:13:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-10 10:13:37,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:37,801 WARN L175 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-09-10 10:13:37,804 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 14 treesize of output 12 [2018-09-10 10:13:37,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:37,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-09-10 10:13:37,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:37,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:37,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-09-10 10:13:38,910 WARN L175 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:13:39,334 WARN L175 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:13:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-10 10:13:39,381 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:39,382 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:13:39,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:13:39,398 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:13:39,460 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:13:39,460 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:39,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-10 10:13:39,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-10 10:13:45,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:13:45,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 13, 6, 6] total 29 [2018-09-10 10:13:45,138 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:13:45,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-10 10:13:45,139 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-10 10:13:45,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=680, Unknown=5, NotChecked=0, Total=812 [2018-09-10 10:13:45,140 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2018-09-10 10:13:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:45,647 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-09-10 10:13:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-10 10:13:45,650 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-09-10 10:13:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:45,651 INFO L225 Difference]: With dead ends: 85 [2018-09-10 10:13:45,651 INFO L226 Difference]: Without dead ends: 59 [2018-09-10 10:13:45,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=163, Invalid=888, Unknown=5, NotChecked=0, Total=1056 [2018-09-10 10:13:45,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-10 10:13:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-09-10 10:13:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-10 10:13:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-09-10 10:13:45,666 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 39 [2018-09-10 10:13:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:45,666 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-09-10 10:13:45,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-10 10:13:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-09-10 10:13:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-10 10:13:45,668 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:45,668 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:45,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash 975793845, now seen corresponding path program 3 times [2018-09-10 10:13:45,669 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:45,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:45,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:13:45,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:45,671 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-10 10:13:45,833 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:45,833 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:45,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:13:45,841 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:13:45,886 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-10 10:13:45,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:45,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-09-10 10:13:45,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-09-10 10:13:46,271 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:46,272 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:13:46,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:13:46,287 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:13:46,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-10 10:13:46,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:46,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-09-10 10:13:46,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-10 10:13:46,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:13:46,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 10, 7, 7] total 15 [2018-09-10 10:13:46,597 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:13:46,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:13:46,597 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:13:46,598 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:13:46,598 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 7 states. [2018-09-10 10:13:46,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:46,844 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-09-10 10:13:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-10 10:13:46,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-09-10 10:13:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:46,848 INFO L225 Difference]: With dead ends: 100 [2018-09-10 10:13:46,848 INFO L226 Difference]: Without dead ends: 66 [2018-09-10 10:13:46,849 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:13:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-10 10:13:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-09-10 10:13:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-10 10:13:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-09-10 10:13:46,861 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-09-10 10:13:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:46,861 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-09-10 10:13:46,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:13:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-09-10 10:13:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-10 10:13:46,862 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:13:46,863 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:13:46,863 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:13:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2017087480, now seen corresponding path program 4 times [2018-09-10 10:13:46,863 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:13:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:46,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:13:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:13:46,864 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:13:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:13:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-10 10:13:47,101 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:47,101 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:13:47,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:13:47,109 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:13:47,133 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:13:47,133 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:47,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:47,175 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-09-10 10:13:47,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:47,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:47,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:13:47,354 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 20 treesize of output 30 [2018-09-10 10:13:47,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-09-10 10:13:47,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:47,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-09-10 10:13:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 65 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-10 10:13:47,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:48,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-09-10 10:13:48,536 WARN L175 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-10 10:13:48,540 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:13:48,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-10 10:13:48,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:48,546 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:13:48,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:48,549 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:13:48,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-09-10 10:13:48,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-09-10 10:13:48,570 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:13:48,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:13:48,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:13:48,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:13:48,601 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-09-10 10:13:48,948 WARN L175 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:13:49,382 WARN L175 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:13:49,758 WARN L175 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:13:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 68 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-10 10:13:49,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:49,791 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:13:49,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:13:49,807 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:13:49,881 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:13:49,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:49,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-09-10 10:13:49,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-09-10 10:13:59,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:13:59,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16, 8, 8] total 37 [2018-09-10 10:13:59,368 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:13:59,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-10 10:13:59,370 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-10 10:13:59,371 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1125, Unknown=8, NotChecked=0, Total=1332 [2018-09-10 10:13:59,371 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 18 states. [2018-09-10 10:14:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:00,240 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-09-10 10:14:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-10 10:14:00,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-09-10 10:14:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:00,243 INFO L225 Difference]: With dead ends: 111 [2018-09-10 10:14:00,243 INFO L226 Difference]: Without dead ends: 77 [2018-09-10 10:14:00,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=253, Invalid=1461, Unknown=8, NotChecked=0, Total=1722 [2018-09-10 10:14:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-10 10:14:00,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2018-09-10 10:14:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-10 10:14:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-10 10:14:00,258 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 53 [2018-09-10 10:14:00,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:00,259 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-10 10:14:00,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-10 10:14:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-10 10:14:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-10 10:14:00,260 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:00,260 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:00,260 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1961401760, now seen corresponding path program 5 times [2018-09-10 10:14:00,261 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:00,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:00,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:14:00,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:00,262 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-10 10:14:00,434 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:00,434 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:00,442 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:14:00,442 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:14:00,827 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-10 10:14:00,827 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:14:00,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:00,847 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-09-10 10:14:00,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:14:00,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:14:00,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:14:00,892 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 20 treesize of output 30 [2018-09-10 10:14:00,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-09-10 10:14:00,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-10 10:14:00,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-09-10 10:14:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 10 proven. 97 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-10 10:14:01,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:02,587 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-09-10 10:14:02,623 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:14:02,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-09-10 10:14:02,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-09-10 10:14:02,646 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:14:02,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:14:02,649 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:14:02,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-10 10:14:02,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:14:02,655 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:14:02,655 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:14:02,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:14:02,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:14:02,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-09-10 10:14:03,848 WARN L175 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:14:06,264 WARN L175 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:14:07,971 WARN L175 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:14:08,372 WARN L175 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:14:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-10 10:14:08,416 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:08,417 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:14:08,433 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:14:08,433 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:14:09,582 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-10 10:14:09,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:14:09,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-09-10 10:14:09,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-10 10:14:26,291 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:14:26,291 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18, 9, 9] total 42 [2018-09-10 10:14:26,291 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:14:26,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-10 10:14:26,292 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-10 10:14:26,294 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1461, Unknown=14, NotChecked=0, Total=1722 [2018-09-10 10:14:26,294 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 20 states. [2018-09-10 10:14:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:14:27,050 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-09-10 10:14:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-10 10:14:27,051 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-09-10 10:14:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:14:27,052 INFO L225 Difference]: With dead ends: 130 [2018-09-10 10:14:27,052 INFO L226 Difference]: Without dead ends: 88 [2018-09-10 10:14:27,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=304, Invalid=1844, Unknown=14, NotChecked=0, Total=2162 [2018-09-10 10:14:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-10 10:14:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-09-10 10:14:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-10 10:14:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-09-10 10:14:27,069 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 64 [2018-09-10 10:14:27,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:14:27,069 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-09-10 10:14:27,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-10 10:14:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-09-10 10:14:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-10 10:14:27,071 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:14:27,071 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:14:27,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:14:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1401291502, now seen corresponding path program 6 times [2018-09-10 10:14:27,072 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:14:27,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:27,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:14:27,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:14:27,073 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:14:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:14:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-09-10 10:14:27,354 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:27,354 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:14:27,362 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-10 10:14:27,363 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-10 10:14:31,067 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-09-10 10:14:31,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:14:31,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:14:31,106 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-09-10 10:14:31,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:14:31,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:14:31,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:14:31,171 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 20 treesize of output 30 [2018-09-10 10:14:31,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-09-10 10:14:31,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:14:31,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2018-09-10 10:14:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 24 proven. 130 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-10 10:14:32,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:14:36,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-09-10 10:14:36,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:14:36,470 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 14 treesize of output 12 [2018-09-10 10:14:36,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:14:36,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:14:36,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-09-10 10:14:38,897 WARN L175 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:14:44,624 WARN L175 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:14:48,906 WARN L175 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:14:51,659 WARN L175 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:14:55,377 WARN L175 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:14:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 133 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-10 10:14:55,425 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:14:55,425 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:14:55,440 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-10 10:14:55,440 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-10 10:15:10,233 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-09-10 10:15:10,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:15:10,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-09-10 10:15:10,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-09-10 10:15:33,371 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:15:33,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 22, 10, 10] total 52 [2018-09-10 10:15:33,371 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:15:33,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-10 10:15:33,372 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-10 10:15:33,373 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2258, Unknown=30, NotChecked=0, Total=2652 [2018-09-10 10:15:33,373 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2018-09-10 10:15:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:15:38,525 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-09-10 10:15:38,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-10 10:15:38,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-09-10 10:15:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:15:38,527 INFO L225 Difference]: With dead ends: 149 [2018-09-10 10:15:38,527 INFO L226 Difference]: Without dead ends: 99 [2018-09-10 10:15:38,530 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 252 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=814, Invalid=4706, Unknown=30, NotChecked=0, Total=5550 [2018-09-10 10:15:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-10 10:15:38,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-09-10 10:15:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-10 10:15:38,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-09-10 10:15:38,550 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 75 [2018-09-10 10:15:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:15:38,551 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-09-10 10:15:38,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-10 10:15:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-09-10 10:15:38,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-10 10:15:38,553 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:15:38,553 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:15:38,553 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:15:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash 724339606, now seen corresponding path program 7 times [2018-09-10 10:15:38,553 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:15:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:38,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:15:38,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:15:38,555 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:15:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-09-10 10:15:38,963 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:38,963 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:15:38,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:38,970 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:39,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:39,031 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-09-10 10:15:39,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:15:39,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:15:39,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:15:39,087 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 20 treesize of output 30 [2018-09-10 10:15:39,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-09-10 10:15:39,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-10 10:15:39,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-09-10 10:15:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 11 proven. 191 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-09-10 10:15:39,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:15:40,581 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-09-10 10:15:40,612 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:15:40,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:15:40,616 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:15:40,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-09-10 10:15:40,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-09-10 10:15:40,632 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:15:40,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-10 10:15:40,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-10 10:15:40,638 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:15:40,638 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:15:40,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:15:40,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:15:40,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-09-10 10:15:41,035 WARN L175 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:15:42,898 WARN L175 SmtUtils]: Spent 1.77 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:15:44,798 WARN L175 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:15:45,203 WARN L175 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:15:45,600 WARN L175 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:15:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 11 proven. 194 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-09-10 10:15:47,868 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:15:47,868 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:15:47,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:15:47,885 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:15:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:15:48,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:15:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-09-10 10:15:48,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:16:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-09-10 10:16:14,219 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:16:14,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 22, 11, 11] total 52 [2018-09-10 10:16:14,220 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:16:14,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-10 10:16:14,221 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-10 10:16:14,223 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2273, Unknown=21, NotChecked=0, Total=2652 [2018-09-10 10:16:14,223 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 24 states. [2018-09-10 10:16:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:16:15,717 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-09-10 10:16:15,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-10 10:16:15,718 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2018-09-10 10:16:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:16:15,719 INFO L225 Difference]: With dead ends: 168 [2018-09-10 10:16:15,720 INFO L226 Difference]: Without dead ends: 110 [2018-09-10 10:16:15,721 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 300 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=421, Invalid=2750, Unknown=21, NotChecked=0, Total=3192 [2018-09-10 10:16:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-10 10:16:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-09-10 10:16:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-10 10:16:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-09-10 10:16:15,743 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 86 [2018-09-10 10:16:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:16:15,744 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-09-10 10:16:15,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-10 10:16:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-09-10 10:16:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-10 10:16:15,746 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:16:15,746 INFO L376 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:16:15,746 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:16:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash 522887652, now seen corresponding path program 8 times [2018-09-10 10:16:15,747 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:16:15,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:16:15,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:16:15,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:16:15,748 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:16:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:16:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-09-10 10:16:15,998 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:16:15,999 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:16:16,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:16:16,007 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:16:16,041 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:16:16,041 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:16:16,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:16:16,059 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-09-10 10:16:16,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-10 10:16:16,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:16:16,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-09-10 10:16:16,113 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 20 treesize of output 30 [2018-09-10 10:16:16,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-09-10 10:16:16,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-10 10:16:16,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-09-10 10:16:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 13 proven. 247 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-09-10 10:16:17,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:16:17,923 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-09-10 10:16:17,953 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:16:17,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:16:17,955 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-10 10:16:17,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-10 10:16:17,958 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:16:17,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-09-10 10:16:17,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-09-10 10:16:17,985 INFO L682 Elim1Store]: detected equality via solver [2018-09-10 10:16:17,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-09-10 10:16:18,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-10 10:16:18,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:16:18,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-10 10:16:18,063 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-09-10 10:16:19,315 WARN L175 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 10 [2018-09-10 10:16:19,767 WARN L175 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:16:20,172 WARN L175 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:16:21,057 WARN L175 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:16:21,979 WARN L175 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:16:22,288 WARN L175 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-10 10:16:23,649 WARN L175 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:16:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 13 proven. 250 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-09-10 10:16:23,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:16:23,693 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:16:23,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:16:23,710 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:16:23,841 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:16:23,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:16:23,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:16:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-09-10 10:16:23,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:16:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-09-10 10:16:58,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:16:58,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 24, 12, 12] total 57 [2018-09-10 10:16:58,039 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:16:58,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-10 10:16:58,040 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-10 10:16:58,041 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=2744, Unknown=27, NotChecked=0, Total=3192 [2018-09-10 10:16:58,041 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 26 states. [2018-09-10 10:16:59,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:16:59,415 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-09-10 10:16:59,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-10 10:16:59,416 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-09-10 10:16:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:16:59,417 INFO L225 Difference]: With dead ends: 187 [2018-09-10 10:16:59,417 INFO L226 Difference]: Without dead ends: 121 [2018-09-10 10:16:59,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 340 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=487, Invalid=3268, Unknown=27, NotChecked=0, Total=3782 [2018-09-10 10:16:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-10 10:16:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-09-10 10:16:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-10 10:16:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-10 10:16:59,444 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-09-10 10:16:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:16:59,444 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-10 10:16:59,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-10 10:16:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-10 10:16:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-10 10:16:59,446 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:16:59,446 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:16:59,446 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:16:59,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1517547724, now seen corresponding path program 9 times [2018-09-10 10:16:59,447 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:16:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:16:59,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:16:59,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:16:59,448 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:16:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:16:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 16 proven. 155 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-09-10 10:16:59,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:16:59,765 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-10 10:16:59,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:16:59,779 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:17:52,816 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-09-10 10:17:52,816 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:17:52,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:17:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-09-10 10:17:52,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:17:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 16 proven. 155 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-09-10 10:17:53,506 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:17:53,506 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-10 10:17:53,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:17:53,522 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown