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_0684a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:05:17,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:05:17,651 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:05:17,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:05:17,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:05:17,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:05:17,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:05:17,674 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:05:17,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:05:17,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:05:17,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:05:17,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:05:17,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:05:17,688 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:05:17,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:05:17,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:05:17,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:05:17,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:05:17,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:05:17,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:05:17,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:05:17,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:05:17,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:05:17,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:05:17,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:05:17,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:05:17,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:05:17,717 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:05:17,718 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:05:17,719 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:05:17,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:05:17,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:05:17,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:05:17,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:05:17,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:05:17,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:05:17,725 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:05:17,749 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:05:17,750 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:05:17,755 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:05:17,755 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:05:17,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:05:17,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:05:17,756 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:05:17,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:05:17,758 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:05:17,758 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:05:17,758 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:05:17,758 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:05:17,758 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:05:17,759 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:05:17,759 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:05:17,759 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:05:17,759 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:05:17,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:05:17,761 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:05:17,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:05:17,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:05:17,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:05:17,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:05:17,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:05:17,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:05:17,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:05:17,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:05:17,763 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:05:17,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:05:17,763 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:05:17,764 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:05:17,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:05:17,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:05:17,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:05:17,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:05:17,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:05:17,833 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:05:17,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0684a_true-unreach-call.c [2018-09-19 16:05:18,179 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283377425/7a426cd9445f49cea1cd65a2aaf210d1/FLAG2e26c175f [2018-09-19 16:05:18,399 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:05:18,399 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0684a_true-unreach-call.c [2018-09-19 16:05:18,409 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283377425/7a426cd9445f49cea1cd65a2aaf210d1/FLAG2e26c175f [2018-09-19 16:05:18,423 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283377425/7a426cd9445f49cea1cd65a2aaf210d1 [2018-09-19 16:05:18,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:05:18,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:05:18,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:05:18,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:05:18,444 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:05:18,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:05:18" (1/1) ... [2018-09-19 16:05:18,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37529f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:18, skipping insertion in model container [2018-09-19 16:05:18,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:05:18" (1/1) ... [2018-09-19 16:05:18,461 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:05:18,831 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:05:18,861 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:05:18,974 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:05:19,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19 WrapperNode [2018-09-19 16:05:19,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:05:19,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:05:19,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:05:19,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:05:19,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... [2018-09-19 16:05:19,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... [2018-09-19 16:05:19,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... [2018-09-19 16:05:19,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... [2018-09-19 16:05:19,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... [2018-09-19 16:05:19,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... [2018-09-19 16:05:19,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... [2018-09-19 16:05:19,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:05:19,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:05:19,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:05:19,146 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:05:19,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:05:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:05:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:05:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-19 16:05:19,308 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2018-09-19 16:05:19,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2 [2018-09-19 16:05:19,309 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-19 16:05:19,309 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2018-09-19 16:05:19,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:05:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:05:19,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:05:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-19 16:05:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:05:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:05:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:05:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:05:19,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:05:19,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:05:19,311 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2018-09-19 16:05:19,311 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2 [2018-09-19 16:05:19,311 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-19 16:05:19,311 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2018-09-19 16:05:19,311 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:05:19,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:05:19,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:05:19,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:05:19,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:05:19,634 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:19,652 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:19,698 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:19,726 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:19,772 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:19,912 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:19,922 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:19,950 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:21,663 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:21,701 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:21,766 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:21,846 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:21,857 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:21,880 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:24,132 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:24,176 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:24,296 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:26,482 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:26,525 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:43,472 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:43,483 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:05:43,492 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:05:43,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:05:43 BoogieIcfgContainer [2018-09-19 16:05:43,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:05:43,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:05:43,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:05:43,496 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:05:43,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:05:18" (1/3) ... [2018-09-19 16:05:43,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d04c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:05:43, skipping insertion in model container [2018-09-19 16:05:43,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:05:19" (2/3) ... [2018-09-19 16:05:43,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d04c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:05:43, skipping insertion in model container [2018-09-19 16:05:43,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:05:43" (3/3) ... [2018-09-19 16:05:43,499 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0684a_true-unreach-call.c [2018-09-19 16:05:43,508 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:05:43,515 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:05:43,562 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:05:43,563 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:05:43,563 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:05:43,563 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:05:43,563 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:05:43,563 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:05:43,563 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:05:43,564 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:05:43,564 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:05:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 16:05:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-19 16:05:43,612 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:05:43,613 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] [2018-09-19 16:05:43,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:05:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1007379435, now seen corresponding path program 1 times [2018-09-19 16:05:43,626 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:05:43,627 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:05:43,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:05:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:05:43,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:05:43,905 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:05:43,906 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:05:43,928 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:05:43,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:05:43,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:05:43,950 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:05:43,951 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:05:43,954 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 2 states. [2018-09-19 16:05:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:05:44,018 INFO L93 Difference]: Finished difference Result 424 states and 554 transitions. [2018-09-19 16:05:44,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:05:44,019 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-19 16:05:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:05:44,036 INFO L225 Difference]: With dead ends: 424 [2018-09-19 16:05:44,036 INFO L226 Difference]: Without dead ends: 211 [2018-09-19 16:05:44,051 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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:05:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-19 16:05:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-19 16:05:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-19 16:05:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2018-09-19 16:05:44,117 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 27 [2018-09-19 16:05:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:05:44,117 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2018-09-19 16:05:44,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:05:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2018-09-19 16:05:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-19 16:05:44,120 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:05:44,121 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, 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:05:44,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:05:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1648465161, now seen corresponding path program 1 times [2018-09-19 16:05:44,123 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:05:44,123 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:05:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:05:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:05:44,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:05:44,400 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:05:44,401 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:05:44,418 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:05:44,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 16:05:44,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 16:05:44,420 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 16:05:44,420 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:05:44,421 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 3 states. [2018-09-19 16:05:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:05:44,510 INFO L93 Difference]: Finished difference Result 379 states and 458 transitions. [2018-09-19 16:05:44,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 16:05:44,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-09-19 16:05:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:05:44,514 INFO L225 Difference]: With dead ends: 379 [2018-09-19 16:05:44,516 INFO L226 Difference]: Without dead ends: 211 [2018-09-19 16:05:44,517 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:05:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-19 16:05:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-19 16:05:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-19 16:05:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 250 transitions. [2018-09-19 16:05:44,548 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 250 transitions. Word has length 62 [2018-09-19 16:05:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:05:44,549 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 250 transitions. [2018-09-19 16:05:44,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 16:05:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 250 transitions. [2018-09-19 16:05:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-19 16:05:44,552 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:05:44,552 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, 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:05:44,552 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:05:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash -288810204, now seen corresponding path program 1 times [2018-09-19 16:05:44,553 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:05:44,554 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:05:44,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:05:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:05:45,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:05:45,136 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:05:45,145 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:05:45,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:45,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:45,169 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:05:45,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:05:45,221 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:05:45,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:05:45,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:45,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:45,330 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:05:45,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:05:46,565 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:05:46,574 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:05:46,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:46,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:46,673 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:05:46,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-19 16:05:46,836 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:05:46,844 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:05:46,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:46,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:46,945 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:05:46,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-19 16:05:47,540 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:05:47,541 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:05:47,543 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:05:47,569 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:05:47,612 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:05:47,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:47,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:47,704 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:05:47,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2018-09-19 16:05:48,619 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:05:48,633 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:05:48,635 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:05:48,654 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:05:48,678 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:05:48,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:48,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:48,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-09-19 16:05:48,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:70 [2018-09-19 16:05:49,086 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:05:49,107 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:05:49,115 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:05:49,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:49,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:49,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:05:49,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:59, output treesize:33 [2018-09-19 16:05:50,608 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-09-19 16:05:50,698 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:05:50,699 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:05:50,717 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:05:50,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-19 16:05:50,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-19 16:05:50,719 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-19 16:05:50,719 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-09-19 16:05:50,720 INFO L87 Difference]: Start difference. First operand 211 states and 250 transitions. Second operand 23 states. [2018-09-19 16:05:53,825 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-09-19 16:05:54,431 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-09-19 16:05:55,839 WARN L178 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-19 16:05:56,371 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:05:56,854 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-19 16:05:57,537 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:05:58,396 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:05:59,006 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-19 16:05:59,683 WARN L178 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-19 16:06:00,447 WARN L178 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:06:00,946 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-19 16:06:01,577 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:06:02,375 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-09-19 16:06:05,307 WARN L178 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 55 [2018-09-19 16:06:06,567 WARN L178 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-09-19 16:06:07,541 WARN L178 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:06:08,388 WARN L178 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-19 16:06:11,868 WARN L178 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-09-19 16:06:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:59,033 INFO L93 Difference]: Finished difference Result 254 states and 302 transitions. [2018-09-19 16:06:59,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-19 16:06:59,037 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-09-19 16:06:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:59,040 INFO L225 Difference]: With dead ends: 254 [2018-09-19 16:06:59,040 INFO L226 Difference]: Without dead ends: 200 [2018-09-19 16:06:59,042 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=252, Invalid=2003, Unknown=1, NotChecked=0, Total=2256 [2018-09-19 16:06:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-19 16:06:59,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-19 16:06:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-19 16:06:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 228 transitions. [2018-09-19 16:06:59,062 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 228 transitions. Word has length 82 [2018-09-19 16:06:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:59,062 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 228 transitions. [2018-09-19 16:06:59,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-19 16:06:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 228 transitions. [2018-09-19 16:06:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:06:59,066 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:59,066 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, 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, 1, 1, 1, 1, 1] [2018-09-19 16:06:59,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1008594192, now seen corresponding path program 1 times [2018-09-19 16:06:59,067 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:59,068 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:06:59,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:59,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:59,438 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:06:59,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-19 16:06:59,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:59,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:59,466 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:06:59,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:06:59,508 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:06:59,513 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:06:59,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:59,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:59,529 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:06:59,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:06:59,947 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:06:59,947 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:59,966 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:59,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:06:59,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:06:59,967 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:06:59,967 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:06:59,967 INFO L87 Difference]: Start difference. First operand 200 states and 228 transitions. Second operand 9 states. [2018-09-19 16:07:01,334 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:07:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:08,578 INFO L93 Difference]: Finished difference Result 249 states and 288 transitions. [2018-09-19 16:07:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:07:08,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-09-19 16:07:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:08,582 INFO L225 Difference]: With dead ends: 249 [2018-09-19 16:07:08,582 INFO L226 Difference]: Without dead ends: 194 [2018-09-19 16:07:08,583 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:07:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-19 16:07:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-19 16:07:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-19 16:07:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2018-09-19 16:07:08,607 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 87 [2018-09-19 16:07:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:08,608 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2018-09-19 16:07:08,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:07:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2018-09-19 16:07:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:07:08,610 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:07:08,610 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, 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, 1, 1, 1, 1, 1] [2018-09-19 16:07:08,611 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:07:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash 647256368, now seen corresponding path program 1 times [2018-09-19 16:07:08,611 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:07:08,612 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:07:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:07:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:07:08,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:07:09,378 WARN L178 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:07:09,962 WARN L178 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:07:10,433 WARN L178 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:07:11,250 WARN L178 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:07:11,273 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:07:11,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:07:11,286 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:07:11,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:07:11,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:07:11,287 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:07:11,287 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:07:11,287 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand 7 states. [2018-09-19 16:07:21,703 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:07:24,451 WARN L178 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:07:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:36,467 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2018-09-19 16:07:36,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:07:36,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-09-19 16:07:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:36,472 INFO L225 Difference]: With dead ends: 201 [2018-09-19 16:07:36,472 INFO L226 Difference]: Without dead ends: 194 [2018-09-19 16:07:36,473 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:07:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-19 16:07:36,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-19 16:07:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-19 16:07:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 216 transitions. [2018-09-19 16:07:36,492 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 216 transitions. Word has length 87 [2018-09-19 16:07:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:36,493 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 216 transitions. [2018-09-19 16:07:36,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 16:07:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 216 transitions. [2018-09-19 16:07:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:07:36,495 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:07:36,495 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, 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, 1, 1, 1, 1, 1] [2018-09-19 16:07:36,495 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:07:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1127750994, now seen corresponding path program 1 times [2018-09-19 16:07:36,496 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:07:36,496 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) [2018-09-19 16:07:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:07:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:07:36,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:07:36,964 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:07:36,978 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:07:36,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:07:37,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:07:37,082 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:07:37,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:07:37,163 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:07:37,181 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:07:37,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:07:37,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:07:37,198 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:07:37,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:07:37,401 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:07:37,401 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:07:37,421 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:07:37,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:07:37,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:07:37,422 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:07:37,422 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:07:37,422 INFO L87 Difference]: Start difference. First operand 194 states and 216 transitions. Second operand 8 states. [2018-09-19 16:07:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:47,819 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2018-09-19 16:07:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:07:47,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-09-19 16:07:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:47,821 INFO L225 Difference]: With dead ends: 201 [2018-09-19 16:07:47,821 INFO L226 Difference]: Without dead ends: 192 [2018-09-19 16:07:47,822 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:07:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-19 16:07:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-09-19 16:07:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-19 16:07:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-09-19 16:07:47,839 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 87 [2018-09-19 16:07:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:47,839 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-09-19 16:07:47,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:07:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-09-19 16:07:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-19 16:07:47,841 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:07:47,841 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, 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, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:07:47,842 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:07:47,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1012082244, now seen corresponding path program 1 times [2018-09-19 16:07:47,842 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:07:47,843 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:07:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:07:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:07:48,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:07:48,411 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:07:48,781 WARN L178 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:07:48,986 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:07:49,402 WARN L178 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:07:49,422 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:07:49,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:07:49,435 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:07:49,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-19 16:07:49,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-19 16:07:49,436 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-19 16:07:49,436 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-19 16:07:49,436 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 7 states. [2018-09-19 16:08:10,153 WARN L178 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:08:10,399 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:08:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:08:18,460 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2018-09-19 16:08:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-19 16:08:18,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-09-19 16:08:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:08:18,473 INFO L225 Difference]: With dead ends: 198 [2018-09-19 16:08:18,473 INFO L226 Difference]: Without dead ends: 190 [2018-09-19 16:08:18,473 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:08:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-19 16:08:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-09-19 16:08:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-19 16:08:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2018-09-19 16:08:18,492 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 89 [2018-09-19 16:08:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:08:18,493 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2018-09-19 16:08:18,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-19 16:08:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2018-09-19 16:08:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-19 16:08:18,494 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:08:18,495 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:08:18,495 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:08:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1062904628, now seen corresponding path program 1 times [2018-09-19 16:08:18,502 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:08:18,502 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) [2018-09-19 16:08:18,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:08:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:08:18,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:08:18,895 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:08:18,901 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:08:18,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:08:18,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:08:18,923 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:08:18,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:08:18,967 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:08:18,973 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:08:18,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:08:18,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:08:18,989 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:08:18,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:08:19,211 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:08:19,212 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:08:19,226 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:08:19,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:08:19,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:08:19,227 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:08:19,227 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:08:19,227 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 9 states. [2018-09-19 16:08:23,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:08:23,369 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-09-19 16:08:23,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:08:23,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-09-19 16:08:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:08:23,372 INFO L225 Difference]: With dead ends: 196 [2018-09-19 16:08:23,373 INFO L226 Difference]: Without dead ends: 152 [2018-09-19 16:08:23,373 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:08:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-19 16:08:23,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-19 16:08:23,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-19 16:08:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-09-19 16:08:23,386 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 90 [2018-09-19 16:08:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:08:23,386 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-09-19 16:08:23,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:08:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-09-19 16:08:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-19 16:08:23,387 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:08:23,388 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, 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, 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:08:23,388 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:08:23,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1509323926, now seen corresponding path program 1 times [2018-09-19 16:08:23,389 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:08:23,389 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) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:08:23,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:08:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:08:23,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:08:23,702 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:08:23,709 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:08:23,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:08:23,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:08:23,731 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:08:23,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:08:23,796 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:08:23,808 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:08:23,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:08:23,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:08:23,826 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:08:23,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:08:24,158 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:08:24,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:08:24,171 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:08:24,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:08:24,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:08:24,172 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:08:24,172 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:08:24,172 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 11 states. [2018-09-19 16:08:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:08:50,572 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2018-09-19 16:08:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:08:50,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 103 [2018-09-19 16:08:50,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:08:51,001 INFO L225 Difference]: With dead ends: 164 [2018-09-19 16:08:51,002 INFO L226 Difference]: Without dead ends: 155 [2018-09-19 16:08:51,002 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-09-19 16:08:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-19 16:08:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-09-19 16:08:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-19 16:08:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-09-19 16:08:51,016 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 103 [2018-09-19 16:08:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:08:51,016 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-09-19 16:08:51,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:08:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-09-19 16:08:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-19 16:08:51,018 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:08:51,018 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, 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, 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:08:51,018 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:08:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash -299784852, now seen corresponding path program 1 times [2018-09-19 16:08:51,019 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:08:51,019 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) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 16:08:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:08:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:08:55,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:08:55,529 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:08:55,536 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:08:55,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:08:55,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:08:55,560 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:08:55,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:08:55,622 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:08:55,628 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:08:55,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:08:55,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:08:55,644 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:08:55,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:08:55,992 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:08:55,992 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:08:56,069 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:08:56,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:08:56,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:08:56,070 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:08:56,071 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:08:56,071 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 11 states. [2018-09-19 16:08:57,497 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-19 16:08:57,849 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:09:08,119 WARN L178 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:09:26,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:09:26,487 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2018-09-19 16:09:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:09:26,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2018-09-19 16:09:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:09:26,588 INFO L225 Difference]: With dead ends: 168 [2018-09-19 16:09:26,588 INFO L226 Difference]: Without dead ends: 151 [2018-09-19 16:09:26,589 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-09-19 16:09:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-19 16:09:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-09-19 16:09:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-19 16:09:26,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-09-19 16:09:26,609 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 105 [2018-09-19 16:09:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:09:26,609 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-09-19 16:09:26,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:09:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-09-19 16:09:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-19 16:09:26,611 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:09:26,611 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, 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, 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:09:26,612 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:09:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -142441100, now seen corresponding path program 1 times [2018-09-19 16:09:26,613 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:09:26,613 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:09:26,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:09:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:09:26,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:09:27,015 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:09:27,022 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:09:27,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,077 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:09:27,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-19 16:09:27,159 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:09:27,169 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:09:27,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,227 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:09:27,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-19 16:09:27,548 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 12 treesize of output 9 [2018-09-19 16:09:27,554 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 9 treesize of output 8 [2018-09-19 16:09:27,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,589 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:09:27,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-09-19 16:09:27,851 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 16 treesize of output 12 [2018-09-19 16:09:27,858 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 12 treesize of output 4 [2018-09-19 16:09:27,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:09:27,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-19 16:09:27,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:29 [2018-09-19 16:09:28,634 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:09:28,635 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:09:28,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:09:28,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 16:09:28,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:09:28,651 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:09:28,651 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:09:28,651 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 14 states. [2018-09-19 16:09:31,030 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-09-19 16:09:31,441 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-09-19 16:09:31,871 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-09-19 16:09:32,371 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-09-19 16:09:32,706 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-09-19 16:09:53,545 WARN L178 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 Received shutdown request... [2018-09-19 16:09:59,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 16:09:59,146 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-19 16:09:59,151 WARN L206 ceAbstractionStarter]: Timeout [2018-09-19 16:09:59,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:09:59 BoogieIcfgContainer [2018-09-19 16:09:59,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:09:59,152 INFO L168 Benchmark]: Toolchain (without parser) took 280719.11 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 856.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.8 MB). Peak memory consumption was 71.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:09:59,153 INFO L168 Benchmark]: CDTParser took 0.22 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:09:59,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.24 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-19 16:09:59,154 INFO L168 Benchmark]: Boogie Preprocessor took 120.20 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:09:59,154 INFO L168 Benchmark]: RCFGBuilder took 24347.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -725.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. [2018-09-19 16:09:59,155 INFO L168 Benchmark]: TraceAbstraction took 255658.45 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 130.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -80.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-09-19 16:09:59,158 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.22 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 587.24 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.20 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 24347.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -725.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 255658.45 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 130.0 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -80.6 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 286]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 286). Cancelled while BasicCegarLoop was constructing difference of abstraction (149states) and FLOYD_HOARE automaton (currently 17 states, 14 states before enhancement), while ReachableStatesComputation was computing reachable states (119 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 216 locations, 1 error locations. TIMEOUT Result, 255.5s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 233.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2188 SDtfs, 1760 SDslu, 11598 SDs, 0 SdLazy, 2380 SolverSat, 125 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 181.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 996 GetRequests, 834 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 50.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 930 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 919 ConstructedInterpolants, 170 QuantifiedInterpolants, 618368 SizeOfPredicates, 89 NumberOfNonLiveVariables, 2147 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown