java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -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-dd2f093 [2018-07-24 10:53:18,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 10:53:18,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 10:53:18,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 10:53:18,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 10:53:18,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 10:53:18,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 10:53:18,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 10:53:18,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 10:53:18,831 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 10:53:18,832 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 10:53:18,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 10:53:18,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 10:53:18,834 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 10:53:18,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 10:53:18,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 10:53:18,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 10:53:18,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 10:53:18,841 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 10:53:18,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 10:53:18,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 10:53:18,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 10:53:18,847 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 10:53:18,847 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 10:53:18,847 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 10:53:18,848 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 10:53:18,849 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 10:53:18,850 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 10:53:18,851 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 10:53:18,852 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 10:53:18,852 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 10:53:18,853 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 10:53:18,853 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 10:53:18,853 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 10:53:18,854 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 10:53:18,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 10:53:18,855 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-07-24 10:53:18,882 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 10:53:18,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 10:53:18,885 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 10:53:18,885 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 10:53:18,885 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 10:53:18,887 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 10:53:18,888 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 10:53:18,888 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 10:53:18,888 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 10:53:18,888 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 10:53:18,888 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 10:53:18,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 10:53:18,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 10:53:18,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 10:53:18,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 10:53:18,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 10:53:18,890 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 10:53:18,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 10:53:18,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 10:53:18,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 10:53:18,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 10:53:18,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 10:53:18,892 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 10:53:18,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 10:53:18,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 10:53:18,893 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 10:53:18,893 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 10:53:18,893 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 10:53:18,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 10:53:18,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 10:53:18,894 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 10:53:18,894 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 10:53:18,894 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 10:53:18,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 10:53:18,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 10:53:18,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 10:53:18,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 10:53:18,962 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 10:53:18,962 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-07-24 10:53:19,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5e0900e/31b2ef86902b40feb040e55b895757d7/FLAG22001816e [2018-07-24 10:53:19,443 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 10:53:19,444 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-07-24 10:53:19,450 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5e0900e/31b2ef86902b40feb040e55b895757d7/FLAG22001816e [2018-07-24 10:53:19,468 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5e0900e/31b2ef86902b40feb040e55b895757d7 [2018-07-24 10:53:19,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 10:53:19,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 10:53:19,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 10:53:19,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 10:53:19,488 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 10:53:19,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a144205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19, skipping insertion in model container [2018-07-24 10:53:19,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,683 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 10:53:19,735 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:53:19,752 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 10:53:19,761 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:53:19,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19 WrapperNode [2018-07-24 10:53:19,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 10:53:19,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 10:53:19,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 10:53:19,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 10:53:19,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 10:53:19,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 10:53:19,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 10:53:19,803 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 10:53:19,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... [2018-07-24 10:53:19,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 10:53:19,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 10:53:19,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 10:53:19,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 10:53:19,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 10:53:19,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 10:53:19,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 10:53:19,903 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-07-24 10:53:19,903 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-07-24 10:53:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 10:53:19,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 10:53:19,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 10:53:19,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 10:53:20,184 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 10:53:20,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:53:20 BoogieIcfgContainer [2018-07-24 10:53:20,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 10:53:20,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 10:53:20,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 10:53:20,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 10:53:20,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 10:53:19" (1/3) ... [2018-07-24 10:53:20,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f45bfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:53:20, skipping insertion in model container [2018-07-24 10:53:20,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:53:19" (2/3) ... [2018-07-24 10:53:20,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f45bfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:53:20, skipping insertion in model container [2018-07-24 10:53:20,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:53:20" (3/3) ... [2018-07-24 10:53:20,193 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-07-24 10:53:20,203 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 10:53:20,211 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 10:53:20,261 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 10:53:20,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 10:53:20,262 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 10:53:20,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 10:53:20,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 10:53:20,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 10:53:20,263 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 10:53:20,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 10:53:20,263 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 10:53:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-07-24 10:53:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-24 10:53:20,288 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:20,289 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:20,289 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash -725873037, now seen corresponding path program 1 times [2018-07-24 10:53:20,304 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:20,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:20,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:20,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:20,416 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:53:20,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 10:53:20,416 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:53:20,421 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-24 10:53:20,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-24 10:53:20,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-24 10:53:20,441 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-07-24 10:53:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:53:20,462 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-07-24 10:53:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-24 10:53:20,464 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-07-24 10:53:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:53:20,472 INFO L225 Difference]: With dead ends: 38 [2018-07-24 10:53:20,472 INFO L226 Difference]: Without dead ends: 19 [2018-07-24 10:53:20,476 INFO L573 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-07-24 10:53:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-24 10:53:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-24 10:53:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-24 10:53:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-07-24 10:53:20,511 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-07-24 10:53:20,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:53:20,512 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-07-24 10:53:20,512 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-24 10:53:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-07-24 10:53:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-24 10:53:20,513 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:20,513 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:20,513 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1889590996, now seen corresponding path program 1 times [2018-07-24 10:53:20,514 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:20,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:20,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:20,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:20,601 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:53:20,602 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 10:53:20,602 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:53:20,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 10:53:20,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 10:53:20,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 10:53:20,605 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-07-24 10:53:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:53:20,755 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-07-24 10:53:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 10:53:20,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-07-24 10:53:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:53:20,759 INFO L225 Difference]: With dead ends: 37 [2018-07-24 10:53:20,759 INFO L226 Difference]: Without dead ends: 26 [2018-07-24 10:53:20,760 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 10:53:20,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-24 10:53:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-07-24 10:53:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-24 10:53:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-07-24 10:53:20,770 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-07-24 10:53:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:53:20,771 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-07-24 10:53:20,771 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 10:53:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-07-24 10:53:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-24 10:53:20,772 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:20,772 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:20,772 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1455859095, now seen corresponding path program 1 times [2018-07-24 10:53:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:20,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:20,896 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:20,896 INFO L191 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-07-24 10:53:20,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:20,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:53:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:20,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:21,039 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-07-24 10:53:21,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:21,067 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-07-24 10:53:21,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:53:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:21,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:21,747 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-07-24 10:53:21,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:21,757 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-07-24 10:53:21,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2018-07-24 10:53:22,836 WARN L169 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:53:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:22,865 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:22,865 INFO L191 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-07-24 10:53:22,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:22,883 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:53:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:22,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:22,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:24,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:53:24,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 4, 4] total 15 [2018-07-24 10:53:24,179 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:53:24,180 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 10:53:24,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 10:53:24,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=165, Unknown=1, NotChecked=0, Total=210 [2018-07-24 10:53:24,181 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-07-24 10:53:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:53:24,553 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-07-24 10:53:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 10:53:24,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-07-24 10:53:24,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:53:24,555 INFO L225 Difference]: With dead ends: 48 [2018-07-24 10:53:24,555 INFO L226 Difference]: Without dead ends: 37 [2018-07-24 10:53:24,557 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=57, Invalid=214, Unknown=1, NotChecked=0, Total=272 [2018-07-24 10:53:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-24 10:53:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-07-24 10:53:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-24 10:53:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-07-24 10:53:24,567 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 17 [2018-07-24 10:53:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:53:24,568 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-07-24 10:53:24,568 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 10:53:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-07-24 10:53:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-24 10:53:24,569 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:24,569 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:24,570 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:24,570 INFO L82 PathProgramCache]: Analyzing trace with hash -231976065, now seen corresponding path program 1 times [2018-07-24 10:53:24,570 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:24,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-24 10:53:24,859 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:24,860 INFO L191 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-07-24 10:53:24,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:24,884 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:53:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:24,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:24,995 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-07-24 10:53:24,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:25,110 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-07-24 10:53:25,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:53:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:25,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:25,809 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-07-24 10:53:25,814 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-07-24 10:53:25,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:25,820 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-07-24 10:53:25,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:25,828 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-07-24 10:53:25,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-07-24 10:53:26,179 WARN L169 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:53:26,989 WARN L169 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 10:53:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:53:27,021 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:27,021 INFO L191 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-07-24 10:53:27,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:27,036 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:53:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:27,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-07-24 10:53:27,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-24 10:53:29,350 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:53:29,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 11, 5, 5] total 24 [2018-07-24 10:53:29,351 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:53:29,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 10:53:29,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 10:53:29,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=455, Unknown=3, NotChecked=0, Total=552 [2018-07-24 10:53:29,352 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2018-07-24 10:53:29,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:53:29,839 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-07-24 10:53:29,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-24 10:53:29,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-07-24 10:53:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:53:29,841 INFO L225 Difference]: With dead ends: 66 [2018-07-24 10:53:29,841 INFO L226 Difference]: Without dead ends: 48 [2018-07-24 10:53:29,843 INFO L573 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-07-24 10:53:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-24 10:53:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-07-24 10:53:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-24 10:53:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-07-24 10:53:29,856 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 28 [2018-07-24 10:53:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:53:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-07-24 10:53:29,857 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 10:53:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-07-24 10:53:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-24 10:53:29,858 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:29,858 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:29,859 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash -547673459, now seen corresponding path program 2 times [2018-07-24 10:53:29,859 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:29,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:53:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:29,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-24 10:53:30,014 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:30,014 INFO L191 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-07-24 10:53:30,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:53:30,032 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:53:30,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:53:30,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:53:30,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:30,088 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-07-24 10:53:30,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:30,136 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-07-24 10:53:30,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:53:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-24 10:53:30,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:30,960 WARN L169 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-07-24 10:53:30,964 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-07-24 10:53:30,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:30,971 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-07-24 10:53:30,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:30,978 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-07-24 10:53:30,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-07-24 10:53:32,095 WARN L169 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:53:32,507 WARN L169 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 10:53:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-24 10:53:32,539 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:32,539 INFO L191 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-07-24 10:53:32,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:53:32,556 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:53:32,621 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:53:32,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:53:32,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-07-24 10:53:32,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-24 10:53:38,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:53:38,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 13, 6, 6] total 29 [2018-07-24 10:53:38,220 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:53:38,220 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-24 10:53:38,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-24 10:53:38,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=680, Unknown=5, NotChecked=0, Total=812 [2018-07-24 10:53:38,227 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2018-07-24 10:53:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:53:38,828 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-07-24 10:53:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-24 10:53:38,829 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-07-24 10:53:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:53:38,831 INFO L225 Difference]: With dead ends: 85 [2018-07-24 10:53:38,831 INFO L226 Difference]: Without dead ends: 59 [2018-07-24 10:53:38,832 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=163, Invalid=888, Unknown=5, NotChecked=0, Total=1056 [2018-07-24 10:53:38,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-24 10:53:38,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-07-24 10:53:38,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-24 10:53:38,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-07-24 10:53:38,847 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 39 [2018-07-24 10:53:38,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:53:38,847 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-07-24 10:53:38,847 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-24 10:53:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-07-24 10:53:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-24 10:53:38,849 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:38,849 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:38,849 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:38,850 INFO L82 PathProgramCache]: Analyzing trace with hash 975793845, now seen corresponding path program 3 times [2018-07-24 10:53:38,850 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:38,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:53:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:38,851 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:38,999 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-07-24 10:53:38,999 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:39,000 INFO L191 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-07-24 10:53:39,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:53:39,008 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:53:39,073 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-24 10:53:39,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:53:39,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-07-24 10:53:39,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-07-24 10:53:39,416 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:39,416 INFO L191 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-07-24 10:53:39,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:53:39,433 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:53:39,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-24 10:53:39,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:53:39,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-07-24 10:53:39,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-07-24 10:53:39,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:53:39,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 10, 7, 7] total 15 [2018-07-24 10:53:39,746 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:53:39,747 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-24 10:53:39,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-24 10:53:39,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-24 10:53:39,749 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 7 states. [2018-07-24 10:53:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:53:40,008 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-07-24 10:53:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 10:53:40,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-07-24 10:53:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:53:40,010 INFO L225 Difference]: With dead ends: 100 [2018-07-24 10:53:40,010 INFO L226 Difference]: Without dead ends: 66 [2018-07-24 10:53:40,011 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-24 10:53:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-24 10:53:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-07-24 10:53:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-24 10:53:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-07-24 10:53:40,023 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-07-24 10:53:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:53:40,023 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-07-24 10:53:40,023 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-24 10:53:40,023 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-07-24 10:53:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-24 10:53:40,025 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:40,025 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:40,025 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:40,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2017087480, now seen corresponding path program 4 times [2018-07-24 10:53:40,026 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:40,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:40,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:53:40,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:40,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-07-24 10:53:40,220 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:40,220 INFO L191 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-07-24 10:53:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:53:40,229 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:53:40,254 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:53:40,255 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:53:40,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:40,285 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-07-24 10:53:40,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:40,295 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-07-24 10:53:40,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:53:40,447 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-07-24 10:53:40,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-24 10:53:40,474 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-07-24 10:53:40,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-07-24 10:53:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 65 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-24 10:53:40,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:41,392 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-07-24 10:53:41,431 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:53:41,435 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-07-24 10:53:41,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:41,438 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:53:41,438 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:41,441 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:53:41,513 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-07-24 10:53:41,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-07-24 10:53:41,526 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:53:41,527 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:41,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:53:41,557 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-07-24 10:53:41,557 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-07-24 10:53:41,914 WARN L169 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:53:42,396 WARN L169 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:53:42,762 WARN L169 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 10:53:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 68 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 10:53:42,792 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:42,792 INFO L191 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-07-24 10:53:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:53:42,808 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:53:42,881 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:53:42,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:53:42,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-07-24 10:53:42,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-07-24 10:53:53,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:53:53,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16, 8, 8] total 37 [2018-07-24 10:53:53,112 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:53:53,112 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-24 10:53:53,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-24 10:53:53,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1124, Unknown=9, NotChecked=0, Total=1332 [2018-07-24 10:53:53,116 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 18 states. [2018-07-24 10:53:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:53:53,948 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-07-24 10:53:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-24 10:53:53,948 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-07-24 10:53:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:53:53,950 INFO L225 Difference]: With dead ends: 111 [2018-07-24 10:53:53,950 INFO L226 Difference]: Without dead ends: 77 [2018-07-24 10:53:53,952 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=253, Invalid=1460, Unknown=9, NotChecked=0, Total=1722 [2018-07-24 10:53:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-24 10:53:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2018-07-24 10:53:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-24 10:53:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-07-24 10:53:53,965 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 53 [2018-07-24 10:53:53,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:53:53,965 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-07-24 10:53:53,965 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-24 10:53:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-07-24 10:53:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-24 10:53:53,967 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:53:53,967 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:53:53,967 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:53:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1961401760, now seen corresponding path program 5 times [2018-07-24 10:53:53,967 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:53:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:53,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:53:53,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:53:53,969 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:53:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:53:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-24 10:53:54,130 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:53:54,130 INFO L191 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-07-24 10:53:54,143 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:53:54,143 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:53:54,544 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-07-24 10:53:54,544 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:53:54,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:53:54,570 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-07-24 10:53:54,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:54,578 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-07-24 10:53:54,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:53:54,612 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-07-24 10:53:54,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-24 10:53:54,636 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-07-24 10:53:54,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-07-24 10:53:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 10 proven. 97 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-07-24 10:53:55,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:53:55,890 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-07-24 10:53:55,920 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:53:55,933 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-07-24 10:53:55,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-07-24 10:53:55,943 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:53:55,943 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:55,945 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:53:55,947 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-07-24 10:53:55,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:55,951 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:53:55,951 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:53:55,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:53:55,986 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-07-24 10:53:55,986 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-07-24 10:53:57,088 WARN L169 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:54:00,013 WARN L169 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:54:01,470 WARN L169 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:54:01,863 WARN L169 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 10:54:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-24 10:54:01,942 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:01,943 INFO L191 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-07-24 10:54:01,959 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:54:01,959 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:54:03,000 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-07-24 10:54:03,000 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:54:03,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-07-24 10:54:03,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-07-24 10:54:17,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:54:17,538 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18, 9, 9] total 42 [2018-07-24 10:54:17,538 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:54:17,539 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-24 10:54:17,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-24 10:54:17,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1462, Unknown=13, NotChecked=0, Total=1722 [2018-07-24 10:54:17,541 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 20 states. [2018-07-24 10:54:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:54:18,418 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-07-24 10:54:18,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-24 10:54:18,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-07-24 10:54:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:54:18,420 INFO L225 Difference]: With dead ends: 130 [2018-07-24 10:54:18,420 INFO L226 Difference]: Without dead ends: 88 [2018-07-24 10:54:18,422 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=304, Invalid=1845, Unknown=13, NotChecked=0, Total=2162 [2018-07-24 10:54:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-24 10:54:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2018-07-24 10:54:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-24 10:54:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-07-24 10:54:18,439 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 64 [2018-07-24 10:54:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:54:18,439 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-07-24 10:54:18,440 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-24 10:54:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-07-24 10:54:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-24 10:54:18,441 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:54:18,441 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:54:18,442 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:54:18,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1401291502, now seen corresponding path program 6 times [2018-07-24 10:54:18,442 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:54:18,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:18,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:54:18,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:54:18,443 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:54:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:54:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-07-24 10:54:18,714 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:18,714 INFO L191 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-07-24 10:54:18,722 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-24 10:54:18,722 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-07-24 10:54:22,395 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-07-24 10:54:22,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:54:22,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:22,433 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-07-24 10:54:22,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:54:22,446 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-07-24 10:54:22,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:54:22,514 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-07-24 10:54:22,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-24 10:54:22,537 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-07-24 10:54:22,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2018-07-24 10:54:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 24 proven. 130 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 10:54:23,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:54:26,131 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-07-24 10:54:26,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:54:26,138 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-07-24 10:54:26,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:54:26,147 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-07-24 10:54:26,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-07-24 10:54:28,304 WARN L169 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:54:31,387 WARN L169 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:54:37,257 WARN L169 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:54:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 21 proven. 133 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 10:54:40,146 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:54:40,146 INFO L191 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-07-24 10:54:40,160 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-24 10:54:40,161 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-07-24 10:54:54,920 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-07-24 10:54:54,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:54:54,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:54:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-07-24 10:54:54,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:55:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-07-24 10:55:16,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:55:16,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 22, 10, 10] total 52 [2018-07-24 10:55:16,917 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:55:16,917 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-24 10:55:16,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-24 10:55:16,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2262, Unknown=26, NotChecked=0, Total=2652 [2018-07-24 10:55:16,918 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 25 states. [2018-07-24 10:55:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:55:21,483 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-07-24 10:55:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-24 10:55:21,484 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 75 [2018-07-24 10:55:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:55:21,486 INFO L225 Difference]: With dead ends: 149 [2018-07-24 10:55:21,486 INFO L226 Difference]: Without dead ends: 99 [2018-07-24 10:55:21,489 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 252 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=814, Invalid=4710, Unknown=26, NotChecked=0, Total=5550 [2018-07-24 10:55:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-24 10:55:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-07-24 10:55:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-24 10:55:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-07-24 10:55:21,509 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 75 [2018-07-24 10:55:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:55:21,510 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-07-24 10:55:21,510 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-24 10:55:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-07-24 10:55:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-24 10:55:21,511 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:55:21,512 INFO L353 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:55:21,512 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:55:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash 724339606, now seen corresponding path program 7 times [2018-07-24 10:55:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:55:21,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:55:21,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:55:21,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:55:21,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:55:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:55:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-07-24 10:55:22,026 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:55:22,026 INFO L191 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-07-24 10:55:22,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:55:22,035 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:55:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:55:22,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:55:22,077 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-07-24 10:55:22,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:22,086 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-07-24 10:55:22,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:55:22,127 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-07-24 10:55:22,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-24 10:55:22,150 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-07-24 10:55:22,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-07-24 10:55:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 11 proven. 191 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-07-24 10:55:22,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:55:23,658 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-07-24 10:55:23,690 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:55:23,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:23,693 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:55:23,706 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-07-24 10:55:23,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-07-24 10:55:23,710 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:55:23,712 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-07-24 10:55:23,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:23,724 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:55:23,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:23,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:55:23,753 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-07-24 10:55:23,754 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-07-24 10:55:24,121 WARN L169 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:55:24,329 WARN L169 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:55:24,993 WARN L169 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:55:25,393 WARN L169 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:55:30,922 WARN L169 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:55:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 11 proven. 194 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-07-24 10:55:31,129 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:55:31,130 INFO L191 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-07-24 10:55:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:55:31,145 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:55:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:55:31,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:55:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-07-24 10:55:31,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:55:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-07-24 10:55:50,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:55:50,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 22, 11, 11] total 52 [2018-07-24 10:55:50,102 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:55:50,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-24 10:55:50,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-24 10:55:50,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2277, Unknown=17, NotChecked=0, Total=2652 [2018-07-24 10:55:50,104 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 24 states. [2018-07-24 10:55:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:55:51,504 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-07-24 10:55:51,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-24 10:55:51,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 86 [2018-07-24 10:55:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:55:51,507 INFO L225 Difference]: With dead ends: 168 [2018-07-24 10:55:51,507 INFO L226 Difference]: Without dead ends: 110 [2018-07-24 10:55:51,509 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 300 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=421, Invalid=2754, Unknown=17, NotChecked=0, Total=3192 [2018-07-24 10:55:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-24 10:55:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-07-24 10:55:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-24 10:55:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-07-24 10:55:51,532 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 86 [2018-07-24 10:55:51,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:55:51,532 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-07-24 10:55:51,533 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-24 10:55:51,533 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-07-24 10:55:51,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-24 10:55:51,535 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:55:51,535 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:55:51,535 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:55:51,535 INFO L82 PathProgramCache]: Analyzing trace with hash 522887652, now seen corresponding path program 8 times [2018-07-24 10:55:51,535 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:55:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:55:51,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:55:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:55:51,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:55:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:55:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-07-24 10:55:51,784 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:55:51,784 INFO L191 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-07-24 10:55:51,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:55:51,793 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:55:51,828 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:55:51,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:55:51,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:55:51,863 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-07-24 10:55:51,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:51,895 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-07-24 10:55:51,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:55:51,932 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-07-24 10:55:51,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-24 10:55:51,955 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-07-24 10:55:51,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:29 [2018-07-24 10:55:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 13 proven. 247 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-07-24 10:55:52,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:55:53,444 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-07-24 10:55:53,477 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:55:53,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:53,478 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:55:53,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:53,480 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:55:53,492 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-07-24 10:55:53,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-07-24 10:55:53,497 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:55:53,499 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-07-24 10:55:53,521 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:55:53,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:55:53,568 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-07-24 10:55:53,568 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-07-24 10:55:53,955 WARN L169 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:55:56,331 WARN L169 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:55:56,730 WARN L169 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:55:57,911 WARN L169 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:55:58,829 WARN L169 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:56:02,619 WARN L169 SmtUtils]: Spent 1.68 s on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:56:03,821 WARN L169 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 11 [2018-07-24 10:56:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 13 proven. 250 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-07-24 10:56:03,862 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:56:03,862 INFO L191 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-07-24 10:56:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:56:03,877 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:56:04,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:56:04,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:56:04,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:56:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-07-24 10:56:04,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:56:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-07-24 10:56:38,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:56:38,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24, 24, 12, 12] total 57 [2018-07-24 10:56:38,805 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:56:38,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-24 10:56:38,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-24 10:56:38,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=2743, Unknown=28, NotChecked=0, Total=3192 [2018-07-24 10:56:38,806 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 26 states. [2018-07-24 10:56:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:56:40,095 INFO L93 Difference]: Finished difference Result 187 states and 192 transitions. [2018-07-24 10:56:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-24 10:56:40,096 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-07-24 10:56:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:56:40,098 INFO L225 Difference]: With dead ends: 187 [2018-07-24 10:56:40,098 INFO L226 Difference]: Without dead ends: 121 [2018-07-24 10:56:40,100 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 340 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 46.6s TimeCoverageRelationStatistics Valid=487, Invalid=3267, Unknown=28, NotChecked=0, Total=3782 [2018-07-24 10:56:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-24 10:56:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-07-24 10:56:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-24 10:56:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-07-24 10:56:40,124 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 97 [2018-07-24 10:56:40,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:56:40,125 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-07-24 10:56:40,125 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-24 10:56:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-07-24 10:56:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-24 10:56:40,127 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:56:40,127 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:56:40,127 INFO L414 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_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:56:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1517547724, now seen corresponding path program 9 times [2018-07-24 10:56:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:56:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:56:40,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:56:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:56:40,128 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:56:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:56:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 16 proven. 155 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-07-24 10:56:40,374 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:56:40,375 INFO L191 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-07-24 10:56:40,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:56:40,383 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:57:35,278 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-07-24 10:57:35,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:57:35,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:57:35,653 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-07-24 10:57:35,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:35,664 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-07-24 10:57:35,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2018-07-24 10:57:35,708 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-07-24 10:57:35,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-07-24 10:57:35,733 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-07-24 10:57:35,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2018-07-24 10:57:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 39 proven. 289 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-07-24 10:57:36,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:57:47,305 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-07-24 10:57:47,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:47,309 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-07-24 10:57:47,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:47,315 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-07-24 10:57:47,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-07-24 10:57:49,751 WARN L169 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 10 [2018-07-24 10:57:52,760 WARN L169 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:57:56,337 WARN L169 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:57:57,940 WARN L169 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 12 Received shutdown request... [2018-07-24 10:58:00,587 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-07-24 10:58:00,787 WARN L512 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:58:00,788 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 10:58:00,793 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 10:58:00,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 10:58:00 BoogieIcfgContainer [2018-07-24 10:58:00,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 10:58:00,794 INFO L168 Benchmark]: Toolchain (without parser) took 281316.15 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 953.7 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 847.7 MB. Max. memory is 7.1 GB. [2018-07-24 10:58:00,795 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 10:58:00,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-24 10:58:00,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 10:58:00,796 INFO L168 Benchmark]: Boogie Preprocessor took 24.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-24 10:58:00,797 INFO L168 Benchmark]: RCFGBuilder took 357.62 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-07-24 10:58:00,797 INFO L168 Benchmark]: TraceAbstraction took 280607.66 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 228.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -243.8 MB). Peak memory consumption was 889.3 MB. Max. memory is 7.1 GB. [2018-07-24 10:58:00,800 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 296.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 357.62 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 280607.66 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 228.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -243.8 MB). Peak memory consumption was 889.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 12). Cancelled while BasicCegarLoop was analyzing trace of length 109 with TraceHistMax 11, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. TIMEOUT Result, 280.5s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 309 SDtfs, 352 SDslu, 2615 SDs, 0 SdLazy, 4171 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2148 GetRequests, 1763 SyntacticMatches, 26 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 3736 ImplicationChecksByTransitivity, 167.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 83 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 20.9s SatisfiabilityAnalysisTime, 166.9s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2525 ConstructedInterpolants, 295 QuantifiedInterpolants, 1125957 SizeOfPredicates, 72 NumberOfNonLiveVariables, 2012 ConjunctsInSsa, 393 ConjunctsInUnsatCore, 47 InterpolantComputations, 2 PerfectInterpolantSequences, 2416/5385 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/simple_array_index_value_true-unreach-call2_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_10-58-00-813.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/simple_array_index_value_true-unreach-call2_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_10-58-00-813.csv Completed graceful shutdown