java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 15:50:26,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 15:50:26,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 15:50:26,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 15:50:26,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 15:50:26,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 15:50:26,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 15:50:26,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 15:50:26,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 15:50:26,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 15:50:26,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 15:50:26,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 15:50:26,226 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 15:50:26,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 15:50:26,229 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 15:50:26,230 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 15:50:26,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 15:50:26,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 15:50:26,242 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 15:50:26,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 15:50:26,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 15:50:26,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 15:50:26,255 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 15:50:26,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 15:50:26,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 15:50:26,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 15:50:26,260 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 15:50:26,261 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 15:50:26,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 15:50:26,262 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 15:50:26,263 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 15:50:26,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 15:50:26,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 15:50:26,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 15:50:26,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 15:50:26,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 15:50:26,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 15:50:26,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 15:50:26,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 15:50:26,285 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 15:50:26,285 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 15:50:26,285 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 15:50:26,286 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 15:50:26,286 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 15:50:26,286 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 15:50:26,286 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 15:50:26,286 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 15:50:26,287 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 15:50:26,287 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 15:50:26,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 15:50:26,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 15:50:26,288 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 15:50:26,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 15:50:26,289 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 15:50:26,289 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 15:50:26,289 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 15:50:26,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 15:50:26,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 15:50:26,290 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 15:50:26,290 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 15:50:26,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:50:26,290 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 15:50:26,290 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 15:50:26,291 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 15:50:26,291 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 15:50:26,291 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 15:50:26,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 15:50:26,291 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 15:50:26,292 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 15:50:26,292 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 15:50:26,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 15:50:26,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 15:50:26,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 15:50:26,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 15:50:26,364 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 15:50:26,365 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-call1_true-termination.i [2018-09-14 15:50:26,719 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c97dc405/648338dda2384ee19ef91ef468bac456/FLAG16eacf5db [2018-09-14 15:50:26,909 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 15:50:26,910 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-09-14 15:50:26,915 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c97dc405/648338dda2384ee19ef91ef468bac456/FLAG16eacf5db [2018-09-14 15:50:26,931 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c97dc405/648338dda2384ee19ef91ef468bac456 [2018-09-14 15:50:26,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 15:50:26,945 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 15:50:26,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 15:50:26,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 15:50:26,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 15:50:26,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:50:26" (1/1) ... [2018-09-14 15:50:26,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efa186f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:26, skipping insertion in model container [2018-09-14 15:50:26,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 03:50:26" (1/1) ... [2018-09-14 15:50:26,973 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 15:50:27,175 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:50:27,194 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 15:50:27,201 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 15:50:27,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27 WrapperNode [2018-09-14 15:50:27,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 15:50:27,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 15:50:27,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 15:50:27,217 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 15:50:27,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 15:50:27,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 15:50:27,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 15:50:27,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 15:50:27,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... [2018-09-14 15:50:27,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 15:50:27,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 15:50:27,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 15:50:27,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 15:50:27,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 15:50:27,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 15:50:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 15:50:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 15:50:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 15:50:27,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 15:50:27,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 15:50:27,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-14 15:50:27,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-14 15:50:27,658 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 15:50:27,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:50:27 BoogieIcfgContainer [2018-09-14 15:50:27,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 15:50:27,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 15:50:27,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 15:50:27,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 15:50:27,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 03:50:26" (1/3) ... [2018-09-14 15:50:27,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c788fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:50:27, skipping insertion in model container [2018-09-14 15:50:27,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 03:50:27" (2/3) ... [2018-09-14 15:50:27,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c788fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 03:50:27, skipping insertion in model container [2018-09-14 15:50:27,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 03:50:27" (3/3) ... [2018-09-14 15:50:27,668 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call1_true-termination.i [2018-09-14 15:50:27,678 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 15:50:27,687 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 15:50:27,741 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 15:50:27,742 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 15:50:27,742 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 15:50:27,742 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 15:50:27,742 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 15:50:27,743 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 15:50:27,743 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 15:50:27,743 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 15:50:27,743 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 15:50:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-09-14 15:50:27,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-14 15:50:27,767 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:50:27,768 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:50:27,769 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:50:27,775 INFO L82 PathProgramCache]: Analyzing trace with hash 188383829, now seen corresponding path program 1 times [2018-09-14 15:50:27,778 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:50:27,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:27,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:27,830 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:50:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:27,891 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:50:27,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-14 15:50:27,892 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:50:27,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-14 15:50:27,913 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-14 15:50:27,914 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-14 15:50:27,917 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-09-14 15:50:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:50:27,943 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2018-09-14 15:50:27,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-14 15:50:27,945 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-09-14 15:50:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:50:27,956 INFO L225 Difference]: With dead ends: 42 [2018-09-14 15:50:27,957 INFO L226 Difference]: Without dead ends: 21 [2018-09-14 15:50:27,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-14 15:50:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-14 15:50:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-14 15:50:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-14 15:50:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-09-14 15:50:28,007 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-09-14 15:50:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:50:28,008 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-09-14 15:50:28,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-14 15:50:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-09-14 15:50:28,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-14 15:50:28,010 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:50:28,010 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:50:28,011 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:50:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1875102229, now seen corresponding path program 1 times [2018-09-14 15:50:28,011 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:50:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:28,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:28,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:28,013 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:50:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:28,126 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 15:50:28,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 15:50:28,126 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 15:50:28,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 15:50:28,128 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 15:50:28,128 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:50:28,129 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2018-09-14 15:50:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:50:28,319 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-09-14 15:50:28,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 15:50:28,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-09-14 15:50:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:50:28,321 INFO L225 Difference]: With dead ends: 42 [2018-09-14 15:50:28,321 INFO L226 Difference]: Without dead ends: 29 [2018-09-14 15:50:28,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 15:50:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-14 15:50:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-09-14 15:50:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-14 15:50:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-09-14 15:50:28,333 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2018-09-14 15:50:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:50:28,333 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-09-14 15:50:28,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 15:50:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-09-14 15:50:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-14 15:50:28,335 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:50:28,335 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:50:28,336 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:50:28,336 INFO L82 PathProgramCache]: Analyzing trace with hash 620435632, now seen corresponding path program 1 times [2018-09-14 15:50:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:50:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:28,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:28,339 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:50:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:28,502 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:28,502 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:50:28,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:28,525 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:50:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:28,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:28,637 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 22 treesize of output 21 [2018-09-14 15:50:28,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:28,647 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 23 treesize of output 22 [2018-09-14 15:50:28,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:28,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-14 15:50:28,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-09-14 15:50:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:29,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:29,910 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2018-09-14 15:50:29,927 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 13 treesize of output 11 [2018-09-14 15:50:29,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:29,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:50:29,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:5 [2018-09-14 15:50:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:30,033 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:30,033 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:50:30,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:30,050 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:50:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:30,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:30,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:30,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:50:30,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 8, 4, 4] total 16 [2018-09-14 15:50:30,191 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:50:30,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-14 15:50:30,192 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-14 15:50:30,195 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-09-14 15:50:30,196 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2018-09-14 15:50:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:50:32,765 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-09-14 15:50:32,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 15:50:32,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-09-14 15:50:32,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:50:32,768 INFO L225 Difference]: With dead ends: 57 [2018-09-14 15:50:32,768 INFO L226 Difference]: Without dead ends: 41 [2018-09-14 15:50:32,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-09-14 15:50:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-14 15:50:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-09-14 15:50:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-14 15:50:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-09-14 15:50:32,779 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 18 [2018-09-14 15:50:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:50:32,779 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-09-14 15:50:32,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-14 15:50:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-09-14 15:50:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-14 15:50:32,781 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:50:32,781 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:50:32,781 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:50:32,782 INFO L82 PathProgramCache]: Analyzing trace with hash -83153009, now seen corresponding path program 1 times [2018-09-14 15:50:32,782 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:50:32,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:32,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:32,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:32,783 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:50:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-14 15:50:32,962 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:32,962 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-14 15:50:32,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:32,981 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:50:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:33,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:33,043 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 23 treesize of output 22 [2018-09-14 15:50:33,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:33,046 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:50:33,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:33,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-14 15:50:33,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-09-14 15:50:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:33,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:35,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-09-14 15:50:35,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:35,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:50:35,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:5 [2018-09-14 15:50:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 15:50:35,692 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:35,692 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:50:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:35,714 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:50:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:35,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 15:50:35,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-14 15:50:35,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:50:35,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10, 5, 5] total 21 [2018-09-14 15:50:35,885 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:50:35,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-14 15:50:35,886 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-14 15:50:35,887 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=335, Unknown=1, NotChecked=0, Total=420 [2018-09-14 15:50:35,887 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-09-14 15:50:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:50:36,437 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-09-14 15:50:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-14 15:50:36,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-09-14 15:50:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:50:36,440 INFO L225 Difference]: With dead ends: 78 [2018-09-14 15:50:36,440 INFO L226 Difference]: Without dead ends: 53 [2018-09-14 15:50:36,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=99, Invalid=406, Unknown=1, NotChecked=0, Total=506 [2018-09-14 15:50:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-14 15:50:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-09-14 15:50:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-14 15:50:36,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-09-14 15:50:36,453 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 30 [2018-09-14 15:50:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:50:36,454 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-09-14 15:50:36,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-14 15:50:36,454 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-09-14 15:50:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-14 15:50:36,456 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:50:36,456 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:50:36,456 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:50:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash -195024815, now seen corresponding path program 1 times [2018-09-14 15:50:36,456 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:50:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:36,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:36,458 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:50:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 15:50:36,630 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:36,630 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:50:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:36,641 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:50:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:36,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:36,669 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 22 treesize of output 21 [2018-09-14 15:50:36,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:36,672 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 23 treesize of output 22 [2018-09-14 15:50:36,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:36,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-14 15:50:36,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-09-14 15:50:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-14 15:50:37,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:39,338 WARN L1001 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~index~0 1))) (or (< 0 (mod .cse0 2)) (= (mod (select c_main_~array~0 (mod .cse0 4294967296)) 4294967296) 0))) is different from true [2018-09-14 15:50:41,444 WARN L178 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 13 [2018-09-14 15:50:41,584 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2018-09-14 15:50:41,588 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 13 treesize of output 11 [2018-09-14 15:50:41,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:41,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:50:41,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:5 [2018-09-14 15:50:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2018-09-14 15:50:41,691 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:41,692 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:50:41,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:41,713 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:50:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:41,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-14 15:50:41,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-14 15:50:42,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:50:42,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 12, 6, 6] total 26 [2018-09-14 15:50:42,462 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:50:42,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 15:50:42,463 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 15:50:42,464 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=484, Unknown=1, NotChecked=46, Total=650 [2018-09-14 15:50:42,464 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 12 states. [2018-09-14 15:50:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:50:42,966 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-09-14 15:50:42,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 15:50:42,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-09-14 15:50:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:50:42,968 INFO L225 Difference]: With dead ends: 99 [2018-09-14 15:50:42,969 INFO L226 Difference]: Without dead ends: 65 [2018-09-14 15:50:42,970 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=136, Invalid=569, Unknown=1, NotChecked=50, Total=756 [2018-09-14 15:50:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-14 15:50:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-09-14 15:50:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-14 15:50:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-09-14 15:50:42,984 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 42 [2018-09-14 15:50:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:50:42,984 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-09-14 15:50:42,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 15:50:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-09-14 15:50:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-14 15:50:42,986 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:50:42,987 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:50:42,987 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:50:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash -87011058, now seen corresponding path program 2 times [2018-09-14 15:50:42,987 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:50:42,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:42,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:50:42,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:42,989 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:50:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-14 15:50:43,680 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:43,680 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:50:43,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:50:43,689 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:50:43,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:50:43,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:50:43,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:43,752 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 23 treesize of output 22 [2018-09-14 15:50:43,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:43,754 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:50:43,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:43,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-14 15:50:43,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-09-14 15:50:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-14 15:50:44,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:46,531 WARN L1001 $PredicateComparison]: unable to prove that (or (not (= (mod (select c_main_~array~0 (mod (+ c_main_~index~0 2) 4294967296)) 4294967296) 0)) (= (mod c_main_~index~0 2) 0)) is different from true [2018-09-14 15:50:48,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-09-14 15:50:48,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:50:48,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:50:48,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:5 [2018-09-14 15:50:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 12 trivial. 12 not checked. [2018-09-14 15:50:50,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:50,828 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:50:50,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:50:50,844 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:50:50,927 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:50:50,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:50:50,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:50:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-09-14 15:50:50,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:50:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-09-14 15:50:55,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:50:55,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 14, 7, 7] total 31 [2018-09-14 15:50:55,459 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:50:55,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-14 15:50:55,460 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-14 15:50:55,462 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=699, Unknown=5, NotChecked=56, Total=930 [2018-09-14 15:50:55,462 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 14 states. [2018-09-14 15:50:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:50:55,981 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2018-09-14 15:50:55,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-14 15:50:55,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-09-14 15:50:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:50:55,982 INFO L225 Difference]: With dead ends: 120 [2018-09-14 15:50:55,983 INFO L226 Difference]: Without dead ends: 77 [2018-09-14 15:50:55,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=187, Invalid=804, Unknown=5, NotChecked=60, Total=1056 [2018-09-14 15:50:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-14 15:50:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-09-14 15:50:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-14 15:50:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-09-14 15:50:56,000 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 54 [2018-09-14 15:50:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:50:56,001 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-09-14 15:50:56,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-14 15:50:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-09-14 15:50:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-14 15:50:56,003 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:50:56,003 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:50:56,004 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:50:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1617530446, now seen corresponding path program 3 times [2018-09-14 15:50:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:50:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:56,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:50:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:50:56,006 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:50:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:50:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:50:56,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:50:56,327 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:50:56,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:50:56,335 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:51:08,606 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-14 15:51:08,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:51:08,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:51:08,628 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:51:08,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:51:08,654 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 10 treesize of output 9 [2018-09-14 15:51:08,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:51:08,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:51:08,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:16 [2018-09-14 15:51:08,742 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:51:08,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:51:10,791 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:51:10,793 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:51:10,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 45 [2018-09-14 15:51:10,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:51:10,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:51:10,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:130, output treesize:29 [2018-09-14 15:51:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:51:10,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:51:16,998 WARN L178 SmtUtils]: Spent 6.02 s on a formula simplification that was a NOOP. DAG size: 12 [2018-09-14 15:51:21,058 WARN L178 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 14 [2018-09-14 15:51:25,117 WARN L1001 $PredicateComparison]: unable to prove that (or (< 0 (mod (+ c_main_~index~0 1) 2)) (<= 1000 (mod (+ c_main_~index~0 3) 4294967296)) (<= 1000 (mod (+ c_main_~index~0 2) 4294967296))) is different from true [2018-09-14 15:51:31,234 WARN L178 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 22 [2018-09-14 15:51:47,418 WARN L178 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2018-09-14 15:51:51,513 WARN L178 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 28 [2018-09-14 15:52:02,038 WARN L178 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2018-09-14 15:52:04,236 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-14 15:52:04,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:52:06,550 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:52:06,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-09-14 15:52:06,634 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:52:06,637 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 20 treesize of output 11 [2018-09-14 15:52:06,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-14 15:52:06,686 INFO L682 Elim1Store]: detected equality via solver [2018-09-14 15:52:06,695 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 19 treesize of output 12 [2018-09-14 15:52:06,696 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-14 15:52:07,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:52:08,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:52:08,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:682, output treesize:15 [2018-09-14 15:52:29,234 WARN L178 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-14 15:52:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 81 refuted. 2 times theorem prover too weak. 12 trivial. 3 not checked. [2018-09-14 15:52:43,626 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:52:43,626 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:52:43,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:52:43,642 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:52:44,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-14 15:52:44,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:52:44,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:52:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:52:44,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:53:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 40 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:11,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:53:11,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 22, 8, 8] total 38 [2018-09-14 15:53:11,055 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:53:11,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 15:53:11,056 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 15:53:11,058 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1009, Unknown=23, NotChecked=70, Total=1406 [2018-09-14 15:53:11,058 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 12 states. [2018-09-14 15:53:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:53:11,375 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2018-09-14 15:53:11,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 15:53:11,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-09-14 15:53:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:53:11,377 INFO L225 Difference]: With dead ends: 137 [2018-09-14 15:53:11,377 INFO L226 Difference]: Without dead ends: 85 [2018-09-14 15:53:11,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 227 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 113.5s TimeCoverageRelationStatistics Valid=304, Invalid=1009, Unknown=23, NotChecked=70, Total=1406 [2018-09-14 15:53:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-14 15:53:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-09-14 15:53:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-14 15:53:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-09-14 15:53:11,394 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 66 [2018-09-14 15:53:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:53:11,394 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-09-14 15:53:11,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 15:53:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-09-14 15:53:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-14 15:53:11,396 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:53:11,396 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:53:11,396 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:53:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash 209288790, now seen corresponding path program 4 times [2018-09-14 15:53:11,397 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:53:11,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:53:11,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:53:11,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:53:11,398 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:53:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:53:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:11,770 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:53:11,770 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:53:11,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:53:11,778 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:53:11,802 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:53:11,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:53:11,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:53:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:53:11,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:53:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:13,950 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:53:13,950 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:53:13,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-14 15:53:13,966 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-14 15:53:14,234 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-14 15:53:14,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:53:14,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:53:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:53:14,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:53:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:14,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:53:14,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 16 [2018-09-14 15:53:14,347 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:53:14,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-14 15:53:14,348 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-14 15:53:14,348 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-09-14 15:53:14,348 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 9 states. [2018-09-14 15:53:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:53:14,691 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2018-09-14 15:53:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-14 15:53:14,692 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-09-14 15:53:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:53:14,693 INFO L225 Difference]: With dead ends: 150 [2018-09-14 15:53:14,693 INFO L226 Difference]: Without dead ends: 93 [2018-09-14 15:53:14,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 267 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-09-14 15:53:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-14 15:53:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-09-14 15:53:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-14 15:53:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2018-09-14 15:53:14,710 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 69 [2018-09-14 15:53:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:53:14,710 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2018-09-14 15:53:14,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-14 15:53:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2018-09-14 15:53:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-14 15:53:14,712 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:53:14,712 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:53:14,712 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:53:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1450540850, now seen corresponding path program 5 times [2018-09-14 15:53:14,712 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:53:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:53:14,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:53:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:53:14,714 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:53:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:53:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:14,872 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:53:14,873 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:53:14,881 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:53:14,881 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:53:15,618 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-14 15:53:15,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:53:15,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:53:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:53:15,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:53:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:20,638 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:53:20,638 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:53:20,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-14 15:53:20,653 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:53:23,224 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-14 15:53:23,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:53:23,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:53:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:53:23,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:53:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:23,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:53:23,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 18 [2018-09-14 15:53:23,300 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:53:23,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-14 15:53:23,301 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-14 15:53:23,301 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=208, Unknown=1, NotChecked=0, Total=306 [2018-09-14 15:53:23,302 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 10 states. [2018-09-14 15:53:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:53:23,827 INFO L93 Difference]: Finished difference Result 163 states and 176 transitions. [2018-09-14 15:53:23,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-14 15:53:23,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-09-14 15:53:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:53:23,830 INFO L225 Difference]: With dead ends: 163 [2018-09-14 15:53:23,830 INFO L226 Difference]: Without dead ends: 101 [2018-09-14 15:53:23,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=97, Invalid=208, Unknown=1, NotChecked=0, Total=306 [2018-09-14 15:53:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-14 15:53:23,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-09-14 15:53:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-14 15:53:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-09-14 15:53:23,849 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 72 [2018-09-14 15:53:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:53:23,850 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-09-14 15:53:23,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-14 15:53:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-09-14 15:53:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-14 15:53:23,851 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:53:23,851 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:53:23,852 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:53:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash -77758250, now seen corresponding path program 6 times [2018-09-14 15:53:23,852 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:53:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:53:23,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:53:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:53:23,853 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:53:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:53:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:24,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:53:24,037 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:53:24,045 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-14 15:53:24,046 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-14 15:53:37,421 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-14 15:53:37,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:53:37,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:53:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:53:37,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:53:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:53:40,085 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:53:40,085 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:53:40,104 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-14 15:53:40,105 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-14 15:54:05,028 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-14 15:54:05,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:54:05,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:54:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:54:05,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:54:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 8 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:05,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:54:05,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 20 [2018-09-14 15:54:05,110 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:54:05,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-14 15:54:05,111 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-14 15:54:05,111 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-09-14 15:54:05,112 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 11 states. [2018-09-14 15:54:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:54:05,629 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2018-09-14 15:54:05,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-14 15:54:05,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-09-14 15:54:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:54:05,631 INFO L225 Difference]: With dead ends: 176 [2018-09-14 15:54:05,631 INFO L226 Difference]: Without dead ends: 109 [2018-09-14 15:54:05,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-09-14 15:54:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-14 15:54:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-09-14 15:54:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-14 15:54:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-09-14 15:54:05,653 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 75 [2018-09-14 15:54:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:54:05,654 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-09-14 15:54:05,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-14 15:54:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-09-14 15:54:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-14 15:54:05,655 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:54:05,656 INFO L376 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:54:05,656 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:54:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1312058546, now seen corresponding path program 7 times [2018-09-14 15:54:05,656 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:54:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:54:05,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:54:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:54:05,658 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:54:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:54:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 8 proven. 126 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:06,297 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:54:06,297 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:54:06,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:54:06,317 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:54:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:54:06,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:54:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:54:06,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:54:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 8 proven. 123 refuted. 3 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:13,720 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:54:13,720 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:54:13,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:54:13,737 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 15:54:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:54:13,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:54:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:54:13,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:54:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 8 proven. 123 refuted. 3 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:14,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:54:14,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 22 [2018-09-14 15:54:14,196 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:54:14,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-14 15:54:14,197 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-14 15:54:14,198 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=320, Unknown=1, NotChecked=0, Total=462 [2018-09-14 15:54:14,199 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 12 states. [2018-09-14 15:54:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:54:15,014 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2018-09-14 15:54:15,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-14 15:54:15,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-09-14 15:54:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:54:15,017 INFO L225 Difference]: With dead ends: 189 [2018-09-14 15:54:15,017 INFO L226 Difference]: Without dead ends: 117 [2018-09-14 15:54:15,017 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 300 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=141, Invalid=320, Unknown=1, NotChecked=0, Total=462 [2018-09-14 15:54:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-14 15:54:15,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2018-09-14 15:54:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-14 15:54:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2018-09-14 15:54:15,033 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 78 [2018-09-14 15:54:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:54:15,034 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2018-09-14 15:54:15,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-14 15:54:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2018-09-14 15:54:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-14 15:54:15,035 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:54:15,036 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:54:15,036 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:54:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1859494742, now seen corresponding path program 8 times [2018-09-14 15:54:15,036 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:54:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:54:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 15:54:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:54:15,037 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:54:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:54:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 8 proven. 155 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:15,273 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:54:15,273 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:54:15,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:54:15,280 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:54:15,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:54:15,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:54:15,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:54:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:54:15,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:54:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 8 proven. 155 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:20,512 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:54:20,512 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 15:54:20,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-14 15:54:20,527 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-14 15:54:20,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-14 15:54:20,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:54:20,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:54:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-14 15:54:20,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 15:54:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 8 proven. 155 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:20,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 15:54:20,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 24 [2018-09-14 15:54:20,689 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 15:54:20,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-14 15:54:20,690 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-14 15:54:20,690 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-09-14 15:54:20,690 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 13 states. [2018-09-14 15:54:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 15:54:21,633 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-09-14 15:54:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-14 15:54:21,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-09-14 15:54:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 15:54:21,636 INFO L225 Difference]: With dead ends: 202 [2018-09-14 15:54:21,636 INFO L226 Difference]: Without dead ends: 125 [2018-09-14 15:54:21,637 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 311 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-09-14 15:54:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-14 15:54:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-09-14 15:54:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-14 15:54:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-09-14 15:54:21,651 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 81 [2018-09-14 15:54:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 15:54:21,652 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-09-14 15:54:21,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-14 15:54:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-09-14 15:54:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-14 15:54:21,653 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 15:54:21,653 INFO L376 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 15:54:21,653 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 15:54:21,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1754580430, now seen corresponding path program 9 times [2018-09-14 15:54:21,654 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 15:54:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:54:21,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-14 15:54:21,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 15:54:21,655 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 15:54:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 15:54:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 8 proven. 187 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-14 15:54:21,897 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 15:54:21,897 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:54:21,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-14 15:54:21,905 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-14 15:54:36,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-09-14 15:54:36,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-14 15:54:37,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 15:54:37,024 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:54:37,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,055 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 10 treesize of output 9 [2018-09-14 15:54:37,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:16 [2018-09-14 15:54:37,134 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,135 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-09-14 15:54:37,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,139 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:54:37,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:29 [2018-09-14 15:54:37,299 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:54:37,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,378 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,380 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,381 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,385 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-09-14 15:54:37,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:163, output treesize:40 [2018-09-14 15:54:37,697 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:54:37,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,726 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,736 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,741 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,749 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,751 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,756 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,763 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:37,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 146 [2018-09-14 15:54:37,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:54:37,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:202, output treesize:53 [2018-09-14 15:54:38,396 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-14 15:54:38,414 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,430 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,438 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,442 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,447 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,452 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,465 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,480 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,486 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,505 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,506 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,507 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-09-14 15:54:38,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 203 [2018-09-14 15:54:38,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:38,536 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,546 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,568 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,571 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,580 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,586 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,596 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,602 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,612 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,618 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,631 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:38,631 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-09-14 15:54:38,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 202 [2018-09-14 15:54:38,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:39,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:54:39,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:235, output treesize:64 [2018-09-14 15:54:39,441 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-14 15:54:40,218 WARN L178 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-09-14 15:54:40,222 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:54:40,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:50,688 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,702 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,720 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,742 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,749 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,757 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,763 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,793 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,803 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,812 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,815 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,823 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,834 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,848 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,861 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,896 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:54:50,896 INFO L303 Elim1Store]: Index analysis took 225 ms [2018-09-14 15:54:50,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 257 [2018-09-14 15:54:50,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:54:53,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:54:53,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:274, output treesize:77 [2018-09-14 15:54:53,851 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-14 15:54:56,762 WARN L178 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 42 [2018-09-14 15:54:56,768 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-14 15:54:56,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-14 15:55:03,633 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,641 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,673 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,679 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,687 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,700 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,715 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,818 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,839 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,868 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,883 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,891 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,914 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,931 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,952 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,971 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:03,992 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:04,041 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:04,066 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:04,088 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:04,112 INFO L700 Elim1Store]: detected not equals via solver [2018-09-14 15:55:04,113 INFO L303 Elim1Store]: Index analysis took 532 ms [2018-09-14 15:55:04,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 338 [2018-09-14 15:55:04,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-14 15:55:06,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-14 15:55:06,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:307, output treesize:88 [2018-09-14 15:55:07,623 WARN L178 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 45 Received shutdown request... [2018-09-14 15:55:11,249 WARN L186 SmtUtils]: Removed 3 from assertion stack [2018-09-14 15:55:11,249 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-14 15:55:11,450 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 15:55:11,450 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 15:55:11,455 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 15:55:11,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 03:55:11 BoogieIcfgContainer [2018-09-14 15:55:11,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 15:55:11,456 INFO L168 Benchmark]: Toolchain (without parser) took 284514.21 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 861.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -254.3 MB). Peak memory consumption was 607.6 MB. Max. memory is 7.1 GB. [2018-09-14 15:55:11,457 INFO L168 Benchmark]: CDTParser took 0.20 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-09-14 15:55:11,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.94 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-09-14 15:55:11,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.26 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-09-14 15:55:11,459 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 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-09-14 15:55:11,459 INFO L168 Benchmark]: RCFGBuilder took 391.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-09-14 15:55:11,460 INFO L168 Benchmark]: TraceAbstraction took 283795.71 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 108.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 544.4 MB). Peak memory consumption was 652.9 MB. Max. memory is 7.1 GB. [2018-09-14 15:55:11,463 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.20 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 269.94 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 25.26 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.74 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 391.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 753.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 283795.71 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 108.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 544.4 MB). Peak memory consumption was 652.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 85 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 47. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. TIMEOUT Result, 283.7s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 445 SDtfs, 290 SDslu, 2458 SDs, 0 SdLazy, 3551 SolverSat, 136 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2418 GetRequests, 2168 SyntacticMatches, 29 SemanticMatches, 221 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 158.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=12, 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, 12 MinimizatonAttempts, 33 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 55.8s SatisfiabilityAnalysisTime, 169.0s InterpolantComputationTime, 1784 NumberOfCodeBlocks, 1784 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 2902 ConstructedInterpolants, 62 QuantifiedInterpolants, 691349 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1998 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 52 InterpolantComputations, 2 PerfectInterpolantSequences, 2365/5510 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-call1_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_15-55-11-474.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/simple_array_index_value_true-unreach-call1_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_15-55-11-474.csv Completed graceful shutdown