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_0682a_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:03:33,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:03:33,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:03:33,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:03:33,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:03:33,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:03:33,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:03:33,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:03:33,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:03:33,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:03:33,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:03:33,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:03:33,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:03:33,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:03:33,622 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:03:33,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:03:33,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:03:33,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:03:33,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:03:33,629 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:03:33,630 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:03:33,631 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:03:33,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:03:33,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:03:33,635 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:03:33,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:03:33,637 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:03:33,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:03:33,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:03:33,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:03:33,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:03:33,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:03:33,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:03:33,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:03:33,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:03:33,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:03:33,643 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:03:33,662 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:03:33,662 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:03:33,663 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:03:33,663 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:03:33,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:03:33,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:03:33,664 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:03:33,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:03:33,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:03:33,665 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:03:33,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:03:33,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:03:33,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:03:33,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:03:33,665 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:03:33,666 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:03:33,666 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:03:33,666 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:03:33,666 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:03:33,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:03:33,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:03:33,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:03:33,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:03:33,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:03:33,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:03:33,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:03:33,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:03:33,668 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:03:33,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:03:33,668 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:03:33,669 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:03:33,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:03:33,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:03:33,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:03:33,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:03:33,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:03:33,742 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:03:33,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0682a_true-unreach-call.c [2018-09-19 16:03:34,085 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce8bee61/01aec441fb664b2f9e8d9946c170e2d8/FLAG80cca9f09 [2018-09-19 16:03:34,335 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:03:34,336 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0682a_true-unreach-call.c [2018-09-19 16:03:34,345 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce8bee61/01aec441fb664b2f9e8d9946c170e2d8/FLAG80cca9f09 [2018-09-19 16:03:34,360 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce8bee61/01aec441fb664b2f9e8d9946c170e2d8 [2018-09-19 16:03:34,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:03:34,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:03:34,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:03:34,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:03:34,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:03:34,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:34,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2e489e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34, skipping insertion in model container [2018-09-19 16:03:34,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:34,403 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:03:34,785 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:03:34,810 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:03:34,908 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:03:34,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34 WrapperNode [2018-09-19 16:03:34,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:03:34,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:03:34,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:03:34,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:03:34,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:34,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:35,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:35,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:35,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:35,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:35,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (1/1) ... [2018-09-19 16:03:35,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:03:35,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:03:35,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:03:35,062 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:03:35,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (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:03:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:03:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:03:35,221 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-19 16:03:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_double [2018-09-19 16:03:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2 [2018-09-19 16:03:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-09-19 16:03:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_double [2018-09-19 16:03:35,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:03:35,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:03:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-19 16:03:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-19 16:03:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:03:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-19 16:03:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:03:35,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:03:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:03:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-19 16:03:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure atan_double [2018-09-19 16:03:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2 [2018-09-19 16:03:35,224 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-09-19 16:03:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_double [2018-09-19 16:03:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:03:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:03:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:03:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:03:35,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-19 16:03:35,522 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:35,560 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:35,620 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:35,637 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:35,698 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:35,834 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:35,847 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:35,898 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:36,663 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:36,689 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:36,699 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:36,753 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:36,762 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:36,778 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:39,349 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:39,360 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:39,375 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:41,472 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:41,525 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:58,685 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:58,697 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:03:58,707 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:03:58,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:03:58 BoogieIcfgContainer [2018-09-19 16:03:58,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:03:58,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:03:58,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:03:58,712 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:03:58,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:03:34" (1/3) ... [2018-09-19 16:03:58,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3588893c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:03:58, skipping insertion in model container [2018-09-19 16:03:58,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:03:34" (2/3) ... [2018-09-19 16:03:58,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3588893c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:03:58, skipping insertion in model container [2018-09-19 16:03:58,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:03:58" (3/3) ... [2018-09-19 16:03:58,717 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a_true-unreach-call.c [2018-09-19 16:03:58,725 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:03:58,734 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 16:03:58,791 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:03:58,791 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:03:58,791 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:03:58,792 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:03:58,792 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:03:58,792 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:03:58,792 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:03:58,792 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:03:58,793 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:03:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 16:03:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-19 16:03:58,831 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:03:58,833 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:03:58,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:03:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1280076185, now seen corresponding path program 1 times [2018-09-19 16:03:58,847 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:03:58,847 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:03:58,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:03:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:03:59,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:03:59,076 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:03:59,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:03:59,094 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:03:59,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:03:59,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:03:59,111 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:03:59,111 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:03:59,114 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 2 states. [2018-09-19 16:03:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:03:59,173 INFO L93 Difference]: Finished difference Result 424 states and 554 transitions. [2018-09-19 16:03:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:03:59,175 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-19 16:03:59,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:03:59,192 INFO L225 Difference]: With dead ends: 424 [2018-09-19 16:03:59,192 INFO L226 Difference]: Without dead ends: 211 [2018-09-19 16:03:59,199 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:03:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-19 16:03:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-19 16:03:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-19 16:03:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2018-09-19 16:03:59,267 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 27 [2018-09-19 16:03:59,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:03:59,268 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2018-09-19 16:03:59,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:03:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2018-09-19 16:03:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-19 16:03:59,271 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:03:59,271 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] [2018-09-19 16:03:59,272 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:03:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1136930595, now seen corresponding path program 1 times [2018-09-19 16:03:59,273 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:03:59,274 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:03:59,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:03:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:03:59,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:03:59,644 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:03:59,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:03:59,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:03:59,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 16:03:59,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 16:03:59,665 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 16:03:59,666 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:03:59,666 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 3 states. [2018-09-19 16:03:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:03:59,715 INFO L93 Difference]: Finished difference Result 379 states and 458 transitions. [2018-09-19 16:03:59,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 16:03:59,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-09-19 16:03:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:03:59,720 INFO L225 Difference]: With dead ends: 379 [2018-09-19 16:03:59,722 INFO L226 Difference]: Without dead ends: 211 [2018-09-19 16:03:59,724 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:03:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-19 16:03:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-19 16:03:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-19 16:03:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 250 transitions. [2018-09-19 16:03:59,746 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 250 transitions. Word has length 66 [2018-09-19 16:03:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:03:59,746 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 250 transitions. [2018-09-19 16:03:59,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 16:03:59,747 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 250 transitions. [2018-09-19 16:03:59,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-19 16:03:59,750 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:03:59,750 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:03:59,750 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:03:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash 622409496, now seen corresponding path program 1 times [2018-09-19 16:03:59,752 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:03:59,752 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:03:59,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:04:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:04:00,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:04:00,365 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:04:00,372 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:04:00,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:04:00,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:04:00,403 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:04:00,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:04:00,525 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:04:00,545 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:04:00,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:04:00,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:04:00,642 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:04:00,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:04:01,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:04:01,774 INFO L682 Elim1Store]: detected equality via solver [2018-09-19 16:04:01,775 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:04:01,824 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:04:01,850 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:04:01,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:04:01,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:04:01,955 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:04:01,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-09-19 16:04:02,377 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-19 16:04:02,598 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 42 treesize of output 33 [2018-09-19 16:04:02,636 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:04:02,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 29 [2018-09-19 16:04:02,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:04:02,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:04:02,936 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:04:02,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:35 [2018-09-19 16:04:05,184 WARN L178 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 30 [2018-09-19 16:04:05,220 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 26 treesize of output 20 [2018-09-19 16:04:05,282 INFO L700 Elim1Store]: detected not equals via solver [2018-09-19 16:04:05,289 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 20 treesize of output 11 [2018-09-19 16:04:05,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:04:05,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:04:05,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:04:05,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:21 [2018-09-19 16:04:06,260 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:04:06,281 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:04:06,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:04:06,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:04:06,441 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:04:06,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-09-19 16:04:06,726 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:04:06,742 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:04:06,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:04:06,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:04:06,784 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:04:06,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:33 [2018-09-19 16:04:08,183 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-09-19 16:04:08,260 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:04:08,260 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:04:08,277 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:04:08,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-09-19 16:04:08,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-19 16:04:08,279 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-19 16:04:08,279 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2018-09-19 16:04:08,280 INFO L87 Difference]: Start difference. First operand 211 states and 250 transitions. Second operand 24 states. [2018-09-19 16:04:12,874 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-09-19 16:04:13,893 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-19 16:04:14,753 WARN L178 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:04:16,840 WARN L178 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:04:19,463 WARN L178 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:04:20,178 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-19 16:04:21,417 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-09-19 16:04:22,261 WARN L178 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-19 16:04:22,852 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-19 16:04:23,837 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-09-19 16:04:25,447 WARN L178 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-19 16:04:26,778 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:04:27,378 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-19 16:04:29,689 WARN L178 SmtUtils]: Spent 793.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-09-19 16:04:57,232 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-19 16:05:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:05:02,112 INFO L93 Difference]: Finished difference Result 283 states and 334 transitions. [2018-09-19 16:05:02,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-19 16:05:02,116 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-09-19 16:05:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:05:02,121 INFO L225 Difference]: With dead ends: 283 [2018-09-19 16:05:02,121 INFO L226 Difference]: Without dead ends: 235 [2018-09-19 16:05:02,126 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=245, Invalid=2011, Unknown=0, NotChecked=0, Total=2256 [2018-09-19 16:05:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-19 16:05:02,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 204. [2018-09-19 16:05:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-19 16:05:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 235 transitions. [2018-09-19 16:05:02,167 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 235 transitions. Word has length 82 [2018-09-19 16:05:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:05:02,168 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 235 transitions. [2018-09-19 16:05:02,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-19 16:05:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 235 transitions. [2018-09-19 16:05:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:05:02,177 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:05:02,178 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:05:02,178 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:05:02,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1295429764, now seen corresponding path program 1 times [2018-09-19 16:05:02,179 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:05:02,179 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) [2018-09-19 16:05:02,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:05:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:05:02,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:05:02,535 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:02,542 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:02,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:02,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:02,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-19 16:05:02,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:05:02,612 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:02,623 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:02,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:02,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:02,645 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:02,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:05:03,410 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:03,411 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:05:03,428 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:05:03,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:05:03,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:05:03,429 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:05:03,429 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:05:03,429 INFO L87 Difference]: Start difference. First operand 204 states and 235 transitions. Second operand 10 states. [2018-09-19 16:05:04,399 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:05:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:05:14,770 INFO L93 Difference]: Finished difference Result 262 states and 310 transitions. [2018-09-19 16:05:14,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:05:14,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-09-19 16:05:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:05:14,777 INFO L225 Difference]: With dead ends: 262 [2018-09-19 16:05:14,777 INFO L226 Difference]: Without dead ends: 202 [2018-09-19 16:05:14,778 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:05:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-19 16:05:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-19 16:05:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-19 16:05:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 229 transitions. [2018-09-19 16:05:14,805 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 229 transitions. Word has length 87 [2018-09-19 16:05:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:05:14,805 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 229 transitions. [2018-09-19 16:05:14,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:05:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 229 transitions. [2018-09-19 16:05:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:05:14,810 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:05:14,810 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:05:14,810 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:05:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash 360420796, now seen corresponding path program 1 times [2018-09-19 16:05:14,811 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:05:14,811 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:05:14,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:05:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:05:15,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:05:15,146 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:15,163 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:15,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:15,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:15,182 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:15,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:05:15,220 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:15,224 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:15,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:15,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:15,238 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:15,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:05:15,487 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:15,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:05:15,499 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:05:15,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:05:15,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:05:15,500 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:05:15,500 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:05:15,501 INFO L87 Difference]: Start difference. First operand 202 states and 229 transitions. Second operand 9 states. [2018-09-19 16:05:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:05:19,887 INFO L93 Difference]: Finished difference Result 208 states and 234 transitions. [2018-09-19 16:05:19,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:05:19,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-09-19 16:05:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:05:19,890 INFO L225 Difference]: With dead ends: 208 [2018-09-19 16:05:19,890 INFO L226 Difference]: Without dead ends: 200 [2018-09-19 16:05:19,891 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 79 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:05:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-19 16:05:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-19 16:05:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-19 16:05:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2018-09-19 16:05:19,904 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 87 [2018-09-19 16:05:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:05:19,904 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2018-09-19 16:05:19,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:05:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2018-09-19 16:05:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-19 16:05:19,906 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:05:19,906 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] [2018-09-19 16:05:19,907 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:05:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash -300968945, now seen corresponding path program 1 times [2018-09-19 16:05:19,907 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:05:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:05:19,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:05:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:05:20,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:05:20,310 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:20,320 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:20,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:20,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:20,491 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:20,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-19 16:05:20,593 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:20,611 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:20,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:20,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:20,756 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:20,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-19 16:05:20,974 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:20,982 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:20,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:20,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:21,030 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:21,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-09-19 16:05:21,152 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:21,160 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:21,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:21,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:21,204 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:21,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:27 [2018-09-19 16:05:22,174 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-09-19 16:05:22,969 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2018-09-19 16:05:23,589 WARN L178 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-09-19 16:05:24,180 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-09-19 16:05:24,228 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:24,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:05:24,242 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:05:24,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-19 16:05:24,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:05:24,243 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:05:24,243 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:05:24,243 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand 17 states. [2018-09-19 16:05:25,666 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:05:26,393 WARN L178 SmtUtils]: Spent 478.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-19 16:05:27,700 WARN L178 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:05:29,740 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:05:30,820 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-19 16:05:34,355 WARN L178 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-19 16:05:35,724 WARN L178 SmtUtils]: Spent 964.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-09-19 16:05:38,217 WARN L178 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2018-09-19 16:05:39,969 WARN L178 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 151 DAG size of output: 149 [2018-09-19 16:05:44,067 WARN L178 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 152 DAG size of output: 145 [2018-09-19 16:05:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:05:56,493 INFO L93 Difference]: Finished difference Result 206 states and 230 transitions. [2018-09-19 16:05:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-19 16:05:56,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-09-19 16:05:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:05:56,498 INFO L225 Difference]: With dead ends: 206 [2018-09-19 16:05:56,498 INFO L226 Difference]: Without dead ends: 200 [2018-09-19 16:05:56,499 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2018-09-19 16:05:56,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-19 16:05:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-19 16:05:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-19 16:05:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 224 transitions. [2018-09-19 16:05:56,514 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 224 transitions. Word has length 88 [2018-09-19 16:05:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:05:56,514 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 224 transitions. [2018-09-19 16:05:56,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:05:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 224 transitions. [2018-09-19 16:05:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-19 16:05:56,518 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:05:56,518 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] [2018-09-19 16:05:56,518 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:05:56,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2134642871, now seen corresponding path program 1 times [2018-09-19 16:05:56,519 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:05:56,519 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:05:56,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:05:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:05:56,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:05:56,782 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:56,788 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:56,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:56,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:56,817 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:56,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:05:56,861 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:56,882 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:56,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:05:56,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:05:56,898 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:56,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:05:57,647 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2018-09-19 16:05:57,842 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:57,842 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:05:57,854 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:05:57,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 16:05:57,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 16:05:57,855 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 16:05:57,855 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-19 16:05:57,856 INFO L87 Difference]: Start difference. First operand 200 states and 224 transitions. Second operand 10 states. [2018-09-19 16:05:59,862 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-19 16:06:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:04,644 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2018-09-19 16:06:04,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:06:04,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-09-19 16:06:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:04,648 INFO L225 Difference]: With dead ends: 206 [2018-09-19 16:06:04,648 INFO L226 Difference]: Without dead ends: 200 [2018-09-19 16:06:04,649 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:06:04,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-19 16:06:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-19 16:06:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-19 16:06:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2018-09-19 16:06:04,666 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 88 [2018-09-19 16:06:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:04,666 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2018-09-19 16:06:04,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 16:06:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2018-09-19 16:06:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-19 16:06:04,669 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:04,669 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:06:04,669 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:04,669 INFO L82 PathProgramCache]: Analyzing trace with hash -102996394, now seen corresponding path program 1 times [2018-09-19 16:06:04,670 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:04,670 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:06:04,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:04,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:05,785 WARN L178 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 16:06:06,203 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:06:06,904 WARN L178 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:06:06,941 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:06,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:06,953 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:06,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 16:06:06,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 16:06:06,955 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 16:06:06,955 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-19 16:06:06,955 INFO L87 Difference]: Start difference. First operand 200 states and 222 transitions. Second operand 6 states. [2018-09-19 16:06:16,949 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 16:06:17,694 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-09-19 16:06:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:22,100 INFO L93 Difference]: Finished difference Result 206 states and 227 transitions. [2018-09-19 16:06:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 16:06:22,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-09-19 16:06:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:22,103 INFO L225 Difference]: With dead ends: 206 [2018-09-19 16:06:22,103 INFO L226 Difference]: Without dead ends: 200 [2018-09-19 16:06:22,103 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:06:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-19 16:06:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-19 16:06:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-19 16:06:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-09-19 16:06:22,121 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 89 [2018-09-19 16:06:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:22,121 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-09-19 16:06:22,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 16:06:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-09-19 16:06:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-19 16:06:22,122 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:22,123 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:06:22,123 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1365669080, now seen corresponding path program 1 times [2018-09-19 16:06:22,123 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:22,124 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:06:22,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:22,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:22,599 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:22,606 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:22,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:22,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:22,633 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:22,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:06:22,677 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:22,682 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:22,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:22,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:22,696 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:22,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:06:23,108 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:23,108 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:23,132 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:23,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:06:23,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:06:23,133 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:06:23,133 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:06:23,133 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 9 states. [2018-09-19 16:06:24,769 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-19 16:06:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:06:35,342 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2018-09-19 16:06:35,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:06:35,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2018-09-19 16:06:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:06:35,345 INFO L225 Difference]: With dead ends: 241 [2018-09-19 16:06:35,345 INFO L226 Difference]: Without dead ends: 200 [2018-09-19 16:06:35,346 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:06:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-19 16:06:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-19 16:06:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-19 16:06:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 219 transitions. [2018-09-19 16:06:35,367 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 219 transitions. Word has length 90 [2018-09-19 16:06:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:06:35,367 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 219 transitions. [2018-09-19 16:06:35,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:06:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2018-09-19 16:06:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-19 16:06:35,368 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:06:35,368 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:06:35,369 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:06:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 281482195, now seen corresponding path program 1 times [2018-09-19 16:06:35,369 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:06:35,369 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:06:35,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:06:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:06:35,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:06:35,898 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:35,907 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:35,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:35,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:35,980 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:35,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-19 16:06:36,394 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-09-19 16:06:36,436 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:36,474 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:36,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,267 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:37,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-19 16:06:37,460 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:37,471 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:37,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,520 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:06:37,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-09-19 16:06:37,665 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:37,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-19 16:06:37,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:06:37,748 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:06:37,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:27 [2018-09-19 16:06:39,042 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-09-19 16:06:39,659 WARN L178 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 120 [2018-09-19 16:06:40,289 WARN L178 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-09-19 16:06:41,171 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-09-19 16:06:41,242 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:41,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:06:41,256 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:06:41,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-19 16:06:41,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-19 16:06:41,257 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-19 16:06:41,257 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:06:41,258 INFO L87 Difference]: Start difference. First operand 200 states and 219 transitions. Second operand 18 states. [2018-09-19 16:06:42,275 WARN L178 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-19 16:06:42,805 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-19 16:06:43,568 WARN L178 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-19 16:06:45,341 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-19 16:06:46,194 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:06:47,000 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-19 16:06:47,559 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-19 16:06:49,271 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-19 16:06:49,945 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-09-19 16:06:53,222 WARN L178 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2018-09-19 16:06:56,563 WARN L178 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 143 DAG size of output: 137 [2018-09-19 16:07:01,060 WARN L178 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 181 DAG size of output: 175 [2018-09-19 16:07:04,486 WARN L178 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 182 DAG size of output: 171 [2018-09-19 16:07:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:12,358 INFO L93 Difference]: Finished difference Result 206 states and 224 transitions. [2018-09-19 16:07:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-19 16:07:12,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 90 [2018-09-19 16:07:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:12,362 INFO L225 Difference]: With dead ends: 206 [2018-09-19 16:07:12,362 INFO L226 Difference]: Without dead ends: 200 [2018-09-19 16:07:12,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2018-09-19 16:07:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-19 16:07:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-19 16:07:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-19 16:07:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2018-09-19 16:07:12,381 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 90 [2018-09-19 16:07:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:12,382 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 218 transitions. [2018-09-19 16:07:12,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-19 16:07:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 218 transitions. [2018-09-19 16:07:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-19 16:07:12,383 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:07:12,383 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] [2018-09-19 16:07:12,383 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:07:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash 92894954, now seen corresponding path program 1 times [2018-09-19 16:07:12,384 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:07:12,384 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) [2018-09-19 16:07:12,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 16:07:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:07:12,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:07:12,874 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:12,887 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:12,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:07:12,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:07:12,937 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:12,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-19 16:07:12,987 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:12,992 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:12,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:07:12,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:07:13,009 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:13,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-19 16:07:13,398 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-19 16:07:13,687 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:13,687 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:07:13,701 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:07:13,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 16:07:13,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 16:07:13,702 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 16:07:13,702 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-09-19 16:07:13,702 INFO L87 Difference]: Start difference. First operand 200 states and 218 transitions. Second operand 11 states. [2018-09-19 16:07:16,818 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-19 16:07:17,244 WARN L178 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-09-19 16:07:17,998 WARN L178 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-09-19 16:07:18,239 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-09-19 16:07:19,034 WARN L178 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-09-19 16:07:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:07:25,785 INFO L93 Difference]: Finished difference Result 231 states and 253 transitions. [2018-09-19 16:07:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:07:25,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-09-19 16:07:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:07:25,787 INFO L225 Difference]: With dead ends: 231 [2018-09-19 16:07:25,787 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:07:25,788 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-09-19 16:07:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:07:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:07:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:07:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:07:25,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2018-09-19 16:07:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:07:25,789 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:07:25,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 16:07:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:07:25,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:07:25,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:07:25,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-19 16:07:25,986 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 276 [2018-09-19 16:07:54,129 WARN L178 SmtUtils]: Spent 27.88 s on a formula simplification. DAG size of input: 277 DAG size of output: 159 [2018-09-19 16:07:54,272 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 Received shutdown request... [2018-09-19 16:08:11,355 WARN L186 SmtUtils]: Removed 14 from assertion stack [2018-09-19 16:08:11,356 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-09-19 16:08:11,357 INFO L168 Benchmark]: Toolchain (without parser) took 276984.02 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 967.8 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 886.4 MB. Max. memory is 7.1 GB. [2018-09-19 16:08:11,357 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:08:11,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.03 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:08:11,358 INFO L168 Benchmark]: Boogie Preprocessor took 93.48 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:08:11,359 INFO L168 Benchmark]: RCFGBuilder took 23646.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -699.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 16:08:11,359 INFO L168 Benchmark]: TraceAbstraction took 252647.42 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 252.7 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -351.0 MB). Peak memory consumption was 849.8 MB. Max. memory is 7.1 GB. [2018-09-19 16:08:11,361 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 590.03 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 93.48 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 23646.49 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 715.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -699.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252647.42 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 252.7 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -351.0 MB). Peak memory consumption was 849.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 285]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 277. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown