java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:19:17,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:19:17,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:19:17,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:19:17,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:19:17,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:19:17,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:19:17,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:19:17,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:19:17,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:19:17,676 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:19:17,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:19:17,677 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:19:17,678 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:19:17,679 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:19:17,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:19:17,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:19:17,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:19:17,693 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:19:17,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:19:17,697 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:19:17,698 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:19:17,701 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:19:17,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:19:17,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:19:17,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:19:17,703 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:19:17,704 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:19:17,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:19:17,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:19:17,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:19:17,706 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:19:17,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:19:17,707 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:19:17,708 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:19:17,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:19:17,709 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:19:17,728 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:19:17,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:19:17,729 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:19:17,729 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:19:17,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:19:17,730 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:19:17,730 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:19:17,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:19:17,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:19:17,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:19:17,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:19:17,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:19:17,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:19:17,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:19:17,732 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:19:17,732 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:19:17,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:19:17,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:19:17,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:19:17,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:19:17,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:19:17,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:19:17,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:19:17,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:19:17,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:19:17,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:19:17,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:19:17,735 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:19:17,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:19:17,735 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:19:17,735 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:19:17,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:19:17,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:19:17,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:19:17,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:19:17,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:19:17,807 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:19:17,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-19 16:19:18,168 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822cdc83/83f368a0d5ed45a5a1ad79a5fdbad5bf/FLAG3f5bfe74d [2018-09-19 16:19:18,299 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:19:18,299 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251a_true-unreach-call.c [2018-09-19 16:19:18,306 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822cdc83/83f368a0d5ed45a5a1ad79a5fdbad5bf/FLAG3f5bfe74d [2018-09-19 16:19:18,321 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8822cdc83/83f368a0d5ed45a5a1ad79a5fdbad5bf [2018-09-19 16:19:18,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:19:18,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:19:18,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:18,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:19:18,344 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:19:18,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a76bf88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18, skipping insertion in model container [2018-09-19 16:19:18,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,364 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:19:18,584 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:18,603 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:19:18,620 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:19:18,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18 WrapperNode [2018-09-19 16:19:18,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:19:18,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:19:18,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:19:18,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:19:18,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (1/1) ... [2018-09-19 16:19:18,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:19:18,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:19:18,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:19:18,707 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:19:18,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (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-19 16:19:18,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:19:18,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:19:18,802 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-19 16:19:18,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-19 16:19:18,802 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-09-19 16:19:18,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:19:18,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:19:18,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:19:18,803 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-19 16:19:18,803 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-19 16:19:18,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:19:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:19:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:19:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:19:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-09-19 16:19:18,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:19:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:19:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:19:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:19:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:19:18,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:19:18,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:19:19,332 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:19,379 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:19,433 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:19:19,633 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:19:19,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:19 BoogieIcfgContainer [2018-09-19 16:19:19,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:19:19,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:19:19,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:19:19,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:19:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:19:18" (1/3) ... [2018-09-19 16:19:19,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b332c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:19, skipping insertion in model container [2018-09-19 16:19:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:19:18" (2/3) ... [2018-09-19 16:19:19,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80b332c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:19:19, skipping insertion in model container [2018-09-19 16:19:19,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:19:19" (3/3) ... [2018-09-19 16:19:19,642 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251a_true-unreach-call.c [2018-09-19 16:19:19,650 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:19:19,657 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:19:19,703 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:19:19,703 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:19:19,704 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:19:19,704 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:19:19,704 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:19:19,704 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:19:19,704 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:19:19,704 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:19:19,704 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:19:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-19 16:19:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-19 16:19:19,732 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:19,733 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:19,735 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1700649700, now seen corresponding path program 1 times [2018-09-19 16:19:19,746 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:19,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:19,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:19,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:19,858 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-19 16:19:19,858 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:19,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:19,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:19:19,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:19:19,897 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:19:19,898 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:19:19,900 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-19 16:19:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:19,924 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-09-19 16:19:19,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:19:19,926 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-19 16:19:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:19,937 INFO L225 Difference]: With dead ends: 88 [2018-09-19 16:19:19,937 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:19,942 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-19 16:19:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-19 16:19:19,994 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-19 16:19:19,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:19,995 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-19 16:19:19,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:19:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-19 16:19:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-19 16:19:20,000 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:20,000 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:20,001 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1378721572, now seen corresponding path program 1 times [2018-09-19 16:19:20,002 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:20,002 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:20,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:20,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:20,205 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-19 16:19:20,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:20,216 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:20,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:20,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:20,219 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:20,219 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:20,219 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-19 16:19:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:20,292 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-19 16:19:20,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:20,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-19 16:19:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:20,297 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:20,297 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:20,298 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-19 16:19:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:20,310 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-19 16:19:20,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:20,311 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:20,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:20,312 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-19 16:19:20,313 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:20,313 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:20,314 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1304320947, now seen corresponding path program 1 times [2018-09-19 16:19:20,315 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:20,315 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:20,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:20,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:20,511 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-19 16:19:20,511 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:20,529 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:20,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:20,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:20,530 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:20,530 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:20,531 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:20,634 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:20,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-19 16:19:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:20,637 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:20,638 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:20,638 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:20,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-19 16:19:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:20,657 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:20,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-19 16:19:20,660 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:20,660 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:20,661 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1932752128, now seen corresponding path program 1 times [2018-09-19 16:19:20,662 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:20,662 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:20,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:20,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:20,785 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-19 16:19:20,786 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:20,799 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:20,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:20,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:20,800 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:20,800 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:20,801 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:20,941 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:20,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-19 16:19:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:20,944 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:20,944 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:20,945 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:20,953 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-19 16:19:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:20,953 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:20,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 16:19:20,955 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:20,955 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:20,956 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1420834481, now seen corresponding path program 1 times [2018-09-19 16:19:20,956 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:20,956 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:20,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:21,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:21,164 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-19 16:19:21,165 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:21,177 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:21,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:21,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:21,178 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:21,178 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:21,179 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:21,226 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-19 16:19:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:21,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-19 16:19:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:21,228 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:21,229 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:21,229 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-19 16:19:21,237 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-19 16:19:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:21,237 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-19 16:19:21,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-19 16:19:21,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-19 16:19:21,239 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:21,239 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:21,239 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:21,239 INFO L82 PathProgramCache]: Analyzing trace with hash -386619982, now seen corresponding path program 1 times [2018-09-19 16:19:21,240 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:21,240 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:21,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:21,734 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-19 16:19:21,734 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:21,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:21,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:19:21,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:19:21,753 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:19:21,753 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:19:21,753 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 9 states. [2018-09-19 16:19:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:22,437 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-19 16:19:22,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 16:19:22,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-09-19 16:19:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:22,440 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:22,440 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:22,441 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-09-19 16:19:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-09-19 16:19:22,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-09-19 16:19:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:22,449 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-09-19 16:19:22,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:19:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-09-19 16:19:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-19 16:19:22,450 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:22,451 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:22,451 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1132927488, now seen corresponding path program 1 times [2018-09-19 16:19:22,452 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:22,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:22,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:22,603 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:22,619 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:22,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:22,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:22,622 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:22,622 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:22,622 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-09-19 16:19:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:22,664 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-19 16:19:22,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:22,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-19 16:19:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:22,666 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:22,666 INFO L226 Difference]: Without dead ends: 49 [2018-09-19 16:19:22,667 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-19 16:19:22,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-19 16:19:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-19 16:19:22,673 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 58 [2018-09-19 16:19:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:22,673 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-19 16:19:22,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-19 16:19:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-19 16:19:22,675 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:22,675 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:22,676 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash 310309699, now seen corresponding path program 1 times [2018-09-19 16:19:22,676 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:22,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:22,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:22,850 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:22,861 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:22,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:22,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:22,862 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:22,862 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:22,862 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-19 16:19:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:22,902 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-09-19 16:19:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:22,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-19 16:19:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:22,908 INFO L225 Difference]: With dead ends: 58 [2018-09-19 16:19:22,908 INFO L226 Difference]: Without dead ends: 52 [2018-09-19 16:19:22,908 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-19 16:19:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-19 16:19:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-19 16:19:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-19 16:19:22,915 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 59 [2018-09-19 16:19:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:22,915 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-19 16:19:22,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-19 16:19:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:22,917 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:22,917 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:22,917 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:22,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1101257373, now seen corresponding path program 1 times [2018-09-19 16:19:22,918 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:22,918 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:19:22,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:23,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:23,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:23,111 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 11 treesize of output 10 [2018-09-19 16:19:23,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:23,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:23,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:23,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:23,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:23,227 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:19:23,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:23,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:23,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:23,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:24,250 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:24,260 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:24,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 16:19:24,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 16:19:24,261 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 16:19:24,262 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:19:24,262 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 13 states. [2018-09-19 16:19:28,783 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-19 16:19:29,088 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-19 16:19:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:29,378 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-09-19 16:19:29,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:19:29,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2018-09-19 16:19:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:29,380 INFO L225 Difference]: With dead ends: 63 [2018-09-19 16:19:29,381 INFO L226 Difference]: Without dead ends: 56 [2018-09-19 16:19:29,381 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:19:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-19 16:19:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-09-19 16:19:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-19 16:19:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-19 16:19:29,393 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 60 [2018-09-19 16:19:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:29,399 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-19 16:19:29,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 16:19:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-19 16:19:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:29,400 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:29,406 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:29,406 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash -673749989, now seen corresponding path program 1 times [2018-09-19 16:19:29,407 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:29,407 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:19:29,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:29,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:19:29,664 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:29,682 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:29,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-19 16:19:29,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-19 16:19:29,683 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-19 16:19:29,683 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:19:29,683 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-09-19 16:19:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:30,151 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-19 16:19:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 16:19:30,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-09-19 16:19:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:30,153 INFO L225 Difference]: With dead ends: 60 [2018-09-19 16:19:30,153 INFO L226 Difference]: Without dead ends: 51 [2018-09-19 16:19:30,153 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:19:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-19 16:19:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-19 16:19:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:19:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-19 16:19:30,160 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-19 16:19:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:30,161 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-19 16:19:30,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-19 16:19:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-19 16:19:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-19 16:19:30,162 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:30,163 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:30,163 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash -833861020, now seen corresponding path program 1 times [2018-09-19 16:19:30,163 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:30,164 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:30,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:30,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:30,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:30,325 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:30,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:30,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:30,326 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:30,326 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:30,326 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2018-09-19 16:19:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:30,388 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-09-19 16:19:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:30,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-19 16:19:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:30,390 INFO L225 Difference]: With dead ends: 60 [2018-09-19 16:19:30,390 INFO L226 Difference]: Without dead ends: 54 [2018-09-19 16:19:30,390 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:30,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-19 16:19:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-19 16:19:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-19 16:19:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-19 16:19:30,397 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-19 16:19:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:30,398 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-19 16:19:30,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-19 16:19:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:30,399 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:30,399 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:30,400 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash 777757472, now seen corresponding path program 1 times [2018-09-19 16:19:30,400 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:30,400 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:30,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:30,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:19:30,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:30,854 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:30,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:19:30,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:19:30,855 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:19:30,855 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:19:30,855 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-09-19 16:19:31,281 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-19 16:19:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:31,449 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-09-19 16:19:31,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:19:31,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-19 16:19:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:31,452 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:31,452 INFO L226 Difference]: Without dead ends: 48 [2018-09-19 16:19:31,453 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:19:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-19 16:19:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-19 16:19:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-19 16:19:31,460 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-19 16:19:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:31,460 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-19 16:19:31,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:19:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-19 16:19:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:31,461 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:31,462 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:31,462 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash -583298201, now seen corresponding path program 1 times [2018-09-19 16:19:31,463 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:31,463 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:31,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:31,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:19:31,618 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:19:31,628 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:19:31,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:19:31,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:19:31,629 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:19:31,629 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:31,629 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-09-19 16:19:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:31,647 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-09-19 16:19:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:19:31,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-19 16:19:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:31,648 INFO L225 Difference]: With dead ends: 55 [2018-09-19 16:19:31,649 INFO L226 Difference]: Without dead ends: 48 [2018-09-19 16:19:31,649 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:19:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-19 16:19:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-09-19 16:19:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-09-19 16:19:31,655 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 61 [2018-09-19 16:19:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:31,655 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-09-19 16:19:31,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:19:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-09-19 16:19:31,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-19 16:19:31,656 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:31,656 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:31,657 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:31,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1904214632, now seen corresponding path program 1 times [2018-09-19 16:19:31,657 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:31,658 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:31,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:31,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:31,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:31,844 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 11 treesize of output 10 [2018-09-19 16:19:31,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:31,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:31,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:31,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:31,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:31,930 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:19:31,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:31,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:32,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:32,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:32,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:32,888 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:19:33,285 WARN L178 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:19:33,390 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:19:33,390 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP 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-19 16:19:33,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:33,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:33,474 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:33,475 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:33,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-19 16:19:33,485 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:33,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:33,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:33,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:33,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-19 16:19:33,791 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:33,796 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-19 16:19:33,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:33,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:33,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-19 16:19:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:34,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:34,113 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-19 16:19:34,217 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:19:34,625 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:34,861 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:34,863 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:34,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-19 16:19:34,875 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:34,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:34,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:34,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:34,927 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:34,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:34,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:35,045 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:35,048 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:35,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-19 16:19:35,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:35,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:35,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:35,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:35,141 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:35,144 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:35,145 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:35,147 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:35,156 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:35,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-19 16:19:35,202 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:81, output treesize:33 [2018-09-19 16:19:35,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:19:35,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-19 16:19:35,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:19:35,294 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:19:35,295 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:19:35,295 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 11 states. [2018-09-19 16:19:36,128 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:19:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:37,152 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-09-19 16:19:37,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:37,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-09-19 16:19:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:37,154 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:37,155 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:37,155 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:19:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:37,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-09-19 16:19:37,163 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 61 [2018-09-19 16:19:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:37,163 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-09-19 16:19:37,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:19:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-09-19 16:19:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-19 16:19:37,164 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:37,165 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:37,165 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:37,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2059046953, now seen corresponding path program 1 times [2018-09-19 16:19:37,165 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:37,166 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:37,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:37,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:37,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:37,381 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 11 treesize of output 10 [2018-09-19 16:19:37,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:37,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:37,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:37,489 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:19:37,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:37,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:37,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:37,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:37,898 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:19:38,850 WARN L178 SmtUtils]: Spent 951.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-19 16:19:39,088 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-09-19 16:19:39,524 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:19:39,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP 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-19 16:19:39,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:39,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:39,588 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:39,589 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:39,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-19 16:19:39,599 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:39,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:39,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:39,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:39,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:39,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:39,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-19 16:19:39,773 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:39,777 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-19 16:19:39,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:39,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:39,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:39,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-19 16:19:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:39,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:40,399 WARN L178 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-19 16:19:40,536 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:41,564 WARN L178 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-09-19 16:19:41,669 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:42,491 WARN L178 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:19:42,756 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:42,759 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:42,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2018-09-19 16:19:42,767 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:42,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:42,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:42,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:42,882 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:42,885 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:42,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:42,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:42,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:42,991 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:42,995 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:42,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-19 16:19:43,031 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:43,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:43,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:43,100 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:43,103 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:43,104 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:43,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-19 16:19:43,167 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:101, output treesize:43 [2018-09-19 16:19:43,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:19:43,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-09-19 16:19:43,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:19:43,262 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:19:43,262 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:19:43,263 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 11 states. [2018-09-19 16:19:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:45,826 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-09-19 16:19:45,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:19:45,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-09-19 16:19:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:45,829 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:45,829 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:45,830 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 119 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:19:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:45,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-09-19 16:19:45,835 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 62 [2018-09-19 16:19:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:45,835 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-09-19 16:19:45,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:19:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-09-19 16:19:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-19 16:19:45,836 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:45,837 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:45,837 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash 183414724, now seen corresponding path program 1 times [2018-09-19 16:19:45,838 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:45,838 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:45,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:45,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:46,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-09-19 16:19:46,040 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 11 treesize of output 10 [2018-09-19 16:19:46,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:46,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:19:46,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-19 16:19:46,118 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:19:46,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:46,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:46,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:19:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:46,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:46,695 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-19 16:19:46,924 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-09-19 16:19:47,404 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:19:47,404 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP 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-19 16:19:47,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:47,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:47,481 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:47,481 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:47,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-19 16:19:47,492 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:47,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:47,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:47,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:47,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-09-19 16:19:47,679 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:47,683 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-09-19 16:19:47,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:47,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:47,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:14 [2018-09-19 16:19:48,163 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-19 16:19:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:48,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:49,145 WARN L178 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-09-19 16:19:49,278 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-19 16:19:49,485 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-09-19 16:19:49,783 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:19:50,058 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:50,234 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-19 16:19:50,266 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:50,269 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:50,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2018-09-19 16:19:50,279 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:50,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:50,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:50,340 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:50,344 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:50,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,452 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:50,455 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:50,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 58 [2018-09-19 16:19:50,468 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:50,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-09-19 16:19:50,484 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-09-19 16:19:50,533 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:50,537 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-09-19 16:19:50,538 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,541 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:50,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-09-19 16:19:50,583 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:91, output treesize:38 [2018-09-19 16:19:50,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:19:50,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 14 [2018-09-19 16:19:50,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:19:50,712 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:19:50,712 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-09-19 16:19:50,712 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-09-19 16:19:54,525 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2018-09-19 16:19:55,371 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2018-09-19 16:19:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:19:55,514 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-09-19 16:19:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:19:55,515 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-09-19 16:19:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:19:55,516 INFO L225 Difference]: With dead ends: 57 [2018-09-19 16:19:55,516 INFO L226 Difference]: Without dead ends: 46 [2018-09-19 16:19:55,517 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-09-19 16:19:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-19 16:19:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-19 16:19:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-19 16:19:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-09-19 16:19:55,521 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 63 [2018-09-19 16:19:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:19:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-09-19 16:19:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:19:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-09-19 16:19:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 16:19:55,522 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:19:55,522 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:19:55,522 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:19:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1529769203, now seen corresponding path program 1 times [2018-09-19 16:19:55,522 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:19:55,522 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-19 16:19:55,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:19:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:19:55,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:19:55,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:55,691 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:55,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-19 16:19:55,699 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:55,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-19 16:19:55,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:55,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:55,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:55,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-19 16:19:55,909 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:55,910 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:19:55,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-19 16:19:55,929 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:55,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-19 16:19:55,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:55,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:56,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:56,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-19 16:19:56,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-09-19 16:19:56,100 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:19:56,109 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-19 16:19:56,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:19:56,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:19:56,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:19:56,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-19 16:19:56,840 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-19 16:19:56,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:19:57,463 WARN L178 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-19 16:19:57,621 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:19:57,852 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:19:58,043 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:19:58,179 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-19 16:19:58,335 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-19 16:19:59,507 WARN L178 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 42 [2018-09-19 16:20:00,254 WARN L178 SmtUtils]: Spent 746.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-19 16:20:00,270 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:00,271 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:00,273 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:00,275 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:00,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 132 [2018-09-19 16:20:00,389 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-09-19 16:20:00,419 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:20:00,435 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:20:00,444 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:20:00,466 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:00,488 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:20:00,691 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2018-09-19 16:20:00,691 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_30 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-19 16:20:00,695 INFO L168 Benchmark]: Toolchain (without parser) took 42363.16 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -287.3 MB). Peak memory consumption was 585.1 MB. Max. memory is 7.1 GB. [2018-09-19 16:20:00,695 INFO L168 Benchmark]: CDTParser took 0.23 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-19 16:20:00,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.11 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-19 16:20:00,696 INFO L168 Benchmark]: Boogie Preprocessor took 52.16 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-19 16:20:00,696 INFO L168 Benchmark]: RCFGBuilder took 926.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -764.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. [2018-09-19 16:20:00,697 INFO L168 Benchmark]: TraceAbstraction took 41059.19 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 140.0 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 466.3 MB). Peak memory consumption was 606.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:20:00,700 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.23 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. * CACSL2BoogieTranslator took 319.11 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 Preprocessor took 52.16 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 926.74 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -764.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41059.19 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 140.0 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 466.3 MB). Peak memory consumption was 606.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_30 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_30 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...