java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:33:43,182 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:33:43,184 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:33:43,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:33:43,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:33:43,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:33:43,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:33:43,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:33:43,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:33:43,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:33:43,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:33:43,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:33:43,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:33:43,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:33:43,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:33:43,212 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:33:43,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:33:43,216 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:33:43,217 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:33:43,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:33:43,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:33:43,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:33:43,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:33:43,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:33:43,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:33:43,224 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:33:43,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:33:43,225 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:33:43,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:33:43,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:33:43,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:33:43,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:33:43,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:33:43,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:33:43,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:33:43,238 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:33:43,238 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:33:43,238 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:33:43,239 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:33:43,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:33:43,239 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:33:43,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:33:43,240 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:33:43,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:33:43,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:33:43,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:33:43,241 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:33:43,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:33:43,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:33:43,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:33:43,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:33:43,242 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:33:43,242 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:33:43,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:33:43,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:33:43,242 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:33:43,243 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:33:43,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:33:43,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:33:43,243 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:33:43,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:33:43,244 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:33:43,244 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:33:43,244 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:33:43,244 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:33:43,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:33:43,245 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:33:43,245 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:33:43,246 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:33:43,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:33:43,291 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:33:43,295 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:33:43,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:33:43,297 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:33:43,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-01-23 14:33:43,477 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:33:43,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:33:43,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:33:43,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:33:43,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:33:43,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dec221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43, skipping insertion in model container [2018-01-23 14:33:43,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,513 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:33:43,553 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:33:43,671 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:33:43,688 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:33:43,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43 WrapperNode [2018-01-23 14:33:43,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:33:43,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:33:43,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:33:43,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:33:43,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... [2018-01-23 14:33:43,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:33:43,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:33:43,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:33:43,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:33:43,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (1/1) ... No working directory specified, using /storage/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-01-23 14:33:43,791 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:33:43,791 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:33:43,791 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-23 14:33:43,791 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:33:43,791 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:33:43,791 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-23 14:33:43,792 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:33:43,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:33:43,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:33:44,074 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:33:44,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:33:44 BoogieIcfgContainer [2018-01-23 14:33:44,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:33:44,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:33:44,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:33:44,078 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:33:44,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:33:43" (1/3) ... [2018-01-23 14:33:44,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430904ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:33:44, skipping insertion in model container [2018-01-23 14:33:44,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:33:43" (2/3) ... [2018-01-23 14:33:44,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430904ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:33:44, skipping insertion in model container [2018-01-23 14:33:44,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:33:44" (3/3) ... [2018-01-23 14:33:44,082 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-01-23 14:33:44,088 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:33:44,095 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:33:44,134 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:44,134 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:44,135 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:44,135 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:44,135 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:44,135 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:44,135 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:44,135 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-23 14:33:44,136 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-23 14:33:44,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:33:44,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 69 states. [2018-01-23 14:33:44,237 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-23 14:33:44,237 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:33:44,238 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-23 14:33:44,238 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-23 14:33:44,238 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:33:44,238 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 671) no Hoare annotation was computed. [2018-01-23 14:33:44,238 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 671) no Hoare annotation was computed. [2018-01-23 14:33:44,239 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 671) the Hoare annotation is: true [2018-01-23 14:33:44,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 671) no Hoare annotation was computed. [2018-01-23 14:33:44,239 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 671) the Hoare annotation is: true [2018-01-23 14:33:44,239 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 671) no Hoare annotation was computed. [2018-01-23 14:33:44,239 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 671) the Hoare annotation is: true [2018-01-23 14:33:44,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 671) no Hoare annotation was computed. [2018-01-23 14:33:44,240 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 671) no Hoare annotation was computed. [2018-01-23 14:33:44,240 INFO L401 ceAbstractionStarter]: For program point L641'''''(lines 641 648) no Hoare annotation was computed. [2018-01-23 14:33:44,240 INFO L404 ceAbstractionStarter]: At program point L664'''(lines 664 668) the Hoare annotation is: true [2018-01-23 14:33:44,240 INFO L401 ceAbstractionStarter]: For program point L659'(line 659) no Hoare annotation was computed. [2018-01-23 14:33:44,240 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:33:44,240 INFO L401 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-23 14:33:44,241 INFO L401 ceAbstractionStarter]: For program point L664''''(lines 664 668) no Hoare annotation was computed. [2018-01-23 14:33:44,241 INFO L401 ceAbstractionStarter]: For program point L641''''''(lines 641 648) no Hoare annotation was computed. [2018-01-23 14:33:44,241 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 671) no Hoare annotation was computed. [2018-01-23 14:33:44,241 INFO L401 ceAbstractionStarter]: For program point L664'(line 664) no Hoare annotation was computed. [2018-01-23 14:33:44,241 INFO L404 ceAbstractionStarter]: At program point L653'''(lines 653 656) the Hoare annotation is: true [2018-01-23 14:33:44,241 INFO L401 ceAbstractionStarter]: For program point L641(lines 641 648) no Hoare annotation was computed. [2018-01-23 14:33:44,242 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-23 14:33:44,242 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-23 14:33:44,242 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-23 14:33:44,242 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-23 14:33:44,242 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:33:44,242 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-23 14:33:44,242 INFO L401 ceAbstractionStarter]: For program point L657'(line 657) no Hoare annotation was computed. [2018-01-23 14:33:44,243 INFO L404 ceAbstractionStarter]: At program point L645'(line 645) the Hoare annotation is: true [2018-01-23 14:33:44,243 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-23 14:33:44,243 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-23 14:33:44,243 INFO L401 ceAbstractionStarter]: For program point L637'''(line 637) no Hoare annotation was computed. [2018-01-23 14:33:44,243 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 671) no Hoare annotation was computed. [2018-01-23 14:33:44,243 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-23 14:33:44,244 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 640) no Hoare annotation was computed. [2018-01-23 14:33:44,244 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:33:44,244 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-23 14:33:44,244 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-23 14:33:44,244 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-23 14:33:44,245 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-23 14:33:44,245 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-23 14:33:44,245 INFO L401 ceAbstractionStarter]: For program point L661(line 661) no Hoare annotation was computed. [2018-01-23 14:33:44,245 INFO L401 ceAbstractionStarter]: For program point L661''(lines 661 662) no Hoare annotation was computed. [2018-01-23 14:33:44,245 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-23 14:33:44,245 INFO L401 ceAbstractionStarter]: For program point L645'''(line 645) no Hoare annotation was computed. [2018-01-23 14:33:44,246 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-23 14:33:44,246 INFO L401 ceAbstractionStarter]: For program point L665(line 665) no Hoare annotation was computed. [2018-01-23 14:33:44,246 INFO L401 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2018-01-23 14:33:44,246 INFO L401 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2018-01-23 14:33:44,246 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-23 14:33:44,246 INFO L401 ceAbstractionStarter]: For program point L643'(line 643) no Hoare annotation was computed. [2018-01-23 14:33:44,246 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 671) no Hoare annotation was computed. [2018-01-23 14:33:44,247 INFO L401 ceAbstractionStarter]: For program point L655(line 655) no Hoare annotation was computed. [2018-01-23 14:33:44,247 INFO L401 ceAbstractionStarter]: For program point L653(lines 653 656) no Hoare annotation was computed. [2018-01-23 14:33:44,247 INFO L401 ceAbstractionStarter]: For program point L659(line 659) no Hoare annotation was computed. [2018-01-23 14:33:44,247 INFO L401 ceAbstractionStarter]: For program point L657(lines 657 660) no Hoare annotation was computed. [2018-01-23 14:33:44,247 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 671) the Hoare annotation is: true [2018-01-23 14:33:44,248 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 640) the Hoare annotation is: true [2018-01-23 14:33:44,248 INFO L401 ceAbstractionStarter]: For program point L657'''(lines 657 660) no Hoare annotation was computed. [2018-01-23 14:33:44,248 INFO L401 ceAbstractionStarter]: For program point L657''''(lines 657 660) no Hoare annotation was computed. [2018-01-23 14:33:44,248 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-23 14:33:44,248 INFO L404 ceAbstractionStarter]: At program point L637'(line 637) the Hoare annotation is: true [2018-01-23 14:33:44,248 INFO L401 ceAbstractionStarter]: For program point L665'(line 665) no Hoare annotation was computed. [2018-01-23 14:33:44,248 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-23 14:33:44,249 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-23 14:33:44,249 INFO L401 ceAbstractionStarter]: For program point L641'(line 641) no Hoare annotation was computed. [2018-01-23 14:33:44,249 INFO L401 ceAbstractionStarter]: For program point L641'''(line 641) no Hoare annotation was computed. [2018-01-23 14:33:44,249 INFO L401 ceAbstractionStarter]: For program point L666'(line 666) no Hoare annotation was computed. [2018-01-23 14:33:44,254 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:44,254 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:44,254 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:44,254 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:44,254 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:44,254 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:44,255 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:44,255 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:33:44,255 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-23 14:33:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:33:44,258 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:44,259 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:33:44,260 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:33:44,265 INFO L82 PathProgramCache]: Analyzing trace with hash 187264, now seen corresponding path program 1 times [2018-01-23 14:33:44,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:44,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:44,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:44,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:33:44,350 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:33:44,356 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:33:44,362 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:33:44,362 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:33:44,362 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:33:44,362 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:33:44,363 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:33:44,363 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:33:44,363 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:33:44,363 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:33:44,363 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:33:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-23 14:33:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:33:44,368 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:44,368 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:44,368 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1653990869, now seen corresponding path program 1 times [2018-01-23 14:33:44,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:44,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:44,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:44,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:44,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:44,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:44,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:33:44,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:33:44,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:33:44,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:44,520 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-01-23 14:33:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:44,541 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2018-01-23 14:33:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:33:44,542 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-23 14:33:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:44,550 INFO L225 Difference]: With dead ends: 114 [2018-01-23 14:33:44,550 INFO L226 Difference]: Without dead ends: 60 [2018-01-23 14:33:44,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:33:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-23 14:33:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-23 14:33:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-23 14:33:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-23 14:33:44,585 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 25 [2018-01-23 14:33:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:44,585 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-23 14:33:44,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:33:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-23 14:33:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:33:44,587 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:44,587 INFO L322 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] [2018-01-23 14:33:44,587 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:44,588 INFO L82 PathProgramCache]: Analyzing trace with hash -504410673, now seen corresponding path program 1 times [2018-01-23 14:33:44,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:44,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:44,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:44,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:44,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:44,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:44,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:33:44,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:33:44,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:33:44,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:44,716 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 3 states. [2018-01-23 14:33:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:44,760 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-23 14:33:44,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:33:44,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-01-23 14:33:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:44,762 INFO L225 Difference]: With dead ends: 92 [2018-01-23 14:33:44,762 INFO L226 Difference]: Without dead ends: 76 [2018-01-23 14:33:44,763 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:33:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-23 14:33:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2018-01-23 14:33:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-23 14:33:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-01-23 14:33:44,769 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 37 [2018-01-23 14:33:44,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:44,769 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-01-23 14:33:44,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:33:44,770 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-01-23 14:33:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:33:44,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:44,771 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:44,771 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:44,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1373568971, now seen corresponding path program 1 times [2018-01-23 14:33:44,771 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:44,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:44,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:44,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:44,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:44,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:44,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:33:44,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:33:44,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:33:44,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:44,878 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2018-01-23 14:33:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:45,110 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-01-23 14:33:45,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:33:45,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-23 14:33:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:45,115 INFO L225 Difference]: With dead ends: 169 [2018-01-23 14:33:45,115 INFO L226 Difference]: Without dead ends: 145 [2018-01-23 14:33:45,116 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:33:45,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-23 14:33:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2018-01-23 14:33:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-23 14:33:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-01-23 14:33:45,126 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 42 [2018-01-23 14:33:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:45,126 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-01-23 14:33:45,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:33:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-01-23 14:33:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-23 14:33:45,128 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:45,128 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:45,128 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:45,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1638677120, now seen corresponding path program 1 times [2018-01-23 14:33:45,129 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:45,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:45,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:45,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:45,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:33:45,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:33:45,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-23 14:33:45,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:33:45,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:33:45,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:45,207 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 6 states. [2018-01-23 14:33:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:45,380 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-01-23 14:33:45,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:33:45,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-23 14:33:45,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:45,382 INFO L225 Difference]: With dead ends: 134 [2018-01-23 14:33:45,383 INFO L226 Difference]: Without dead ends: 103 [2018-01-23 14:33:45,383 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:33:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-23 14:33:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-01-23 14:33:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-23 14:33:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-01-23 14:33:45,391 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 42 [2018-01-23 14:33:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:45,392 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-01-23 14:33:45,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:33:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-01-23 14:33:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-23 14:33:45,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:45,394 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:45,394 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -322223851, now seen corresponding path program 1 times [2018-01-23 14:33:45,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:45,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:45,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:45,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:45,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:33:45,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:45,493 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:45,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:45,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:33:45,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:45,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-01-23 14:33:45,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:33:45,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:33:45,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:45,638 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 6 states. [2018-01-23 14:33:45,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:45,671 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-01-23 14:33:45,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:45,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-01-23 14:33:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:45,673 INFO L225 Difference]: With dead ends: 108 [2018-01-23 14:33:45,673 INFO L226 Difference]: Without dead ends: 92 [2018-01-23 14:33:45,674 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-23 14:33:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-01-23 14:33:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-23 14:33:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-01-23 14:33:45,680 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 53 [2018-01-23 14:33:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:45,680 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-01-23 14:33:45,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:33:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-01-23 14:33:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-23 14:33:45,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:45,682 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:45,683 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash -587332000, now seen corresponding path program 1 times [2018-01-23 14:33:45,683 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:45,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:45,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:45,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:45,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:33:45,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:45,772 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:45,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:45,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:33:45,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:45,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-01-23 14:33:45,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:33:45,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:33:45,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:45,866 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2018-01-23 14:33:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:45,958 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2018-01-23 14:33:45,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:33:45,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-01-23 14:33:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:45,961 INFO L225 Difference]: With dead ends: 120 [2018-01-23 14:33:45,961 INFO L226 Difference]: Without dead ends: 104 [2018-01-23 14:33:45,962 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:33:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-23 14:33:45,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-01-23 14:33:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-23 14:33:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-01-23 14:33:45,972 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 53 [2018-01-23 14:33:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:45,973 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-01-23 14:33:45,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:33:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-01-23 14:33:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:33:45,974 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:45,975 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:45,975 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1429743791, now seen corresponding path program 2 times [2018-01-23 14:33:45,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:45,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:45,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:45,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:46,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:33:46,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:46,450 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:46,457 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:33:46,475 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:46,484 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:46,486 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:46,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:33:46,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:46,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-01-23 14:33:46,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-23 14:33:46,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-23 14:33:46,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:33:46,778 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 16 states. [2018-01-23 14:33:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:47,826 INFO L93 Difference]: Finished difference Result 257 states and 290 transitions. [2018-01-23 14:33:47,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-23 14:33:47,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-01-23 14:33:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:47,828 INFO L225 Difference]: With dead ends: 257 [2018-01-23 14:33:47,828 INFO L226 Difference]: Without dead ends: 233 [2018-01-23 14:33:47,829 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2018-01-23 14:33:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-23 14:33:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 150. [2018-01-23 14:33:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-23 14:33:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-01-23 14:33:47,841 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 58 [2018-01-23 14:33:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:47,841 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-01-23 14:33:47,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-23 14:33:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-01-23 14:33:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-23 14:33:47,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:47,843 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:47,843 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1712979939, now seen corresponding path program 1 times [2018-01-23 14:33:47,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:47,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:47,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:47,844 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:47,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:47,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:47,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:47,933 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:47,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:47,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:48,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:48,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-01-23 14:33:48,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-23 14:33:48,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-23 14:33:48,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:33:48,083 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 8 states. [2018-01-23 14:33:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:48,139 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2018-01-23 14:33:48,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:33:48,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-23 14:33:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:48,142 INFO L225 Difference]: With dead ends: 244 [2018-01-23 14:33:48,142 INFO L226 Difference]: Without dead ends: 218 [2018-01-23 14:33:48,143 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-01-23 14:33:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-23 14:33:48,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2018-01-23 14:33:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-23 14:33:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-01-23 14:33:48,157 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 65 [2018-01-23 14:33:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:48,157 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-01-23 14:33:48,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-23 14:33:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-01-23 14:33:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-23 14:33:48,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:48,159 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:48,159 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1486889906, now seen corresponding path program 1 times [2018-01-23 14:33:48,159 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:48,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:48,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:48,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:48,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:48,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:48,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:48,259 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:48,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:48,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:48,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:48,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-01-23 14:33:48,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:33:48,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:33:48,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:33:48,374 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 10 states. [2018-01-23 14:33:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:48,441 INFO L93 Difference]: Finished difference Result 240 states and 269 transitions. [2018-01-23 14:33:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:33:48,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-01-23 14:33:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:48,443 INFO L225 Difference]: With dead ends: 240 [2018-01-23 14:33:48,443 INFO L226 Difference]: Without dead ends: 218 [2018-01-23 14:33:48,443 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:33:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-23 14:33:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 170. [2018-01-23 14:33:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-23 14:33:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2018-01-23 14:33:48,453 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 70 [2018-01-23 14:33:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:48,453 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-01-23 14:33:48,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:33:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2018-01-23 14:33:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-23 14:33:48,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:48,455 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:48,455 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1819098567, now seen corresponding path program 2 times [2018-01-23 14:33:48,455 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:48,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:48,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:48,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:48,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:48,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:33:48,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:48,719 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:48,726 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:33:48,743 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:48,754 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:48,756 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:48,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:48,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:48,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2018-01-23 14:33:48,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:33:48,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:33:48,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:33:48,838 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 20 states. [2018-01-23 14:33:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:49,962 INFO L93 Difference]: Finished difference Result 339 states and 376 transitions. [2018-01-23 14:33:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-23 14:33:49,962 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-01-23 14:33:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:49,964 INFO L225 Difference]: With dead ends: 339 [2018-01-23 14:33:49,964 INFO L226 Difference]: Without dead ends: 287 [2018-01-23 14:33:49,966 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=551, Invalid=2311, Unknown=0, NotChecked=0, Total=2862 [2018-01-23 14:33:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-23 14:33:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2018-01-23 14:33:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-23 14:33:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 202 transitions. [2018-01-23 14:33:49,975 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 202 transitions. Word has length 70 [2018-01-23 14:33:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:49,975 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 202 transitions. [2018-01-23 14:33:49,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:33:49,975 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 202 transitions. [2018-01-23 14:33:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-23 14:33:49,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:49,976 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:49,976 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:49,976 INFO L82 PathProgramCache]: Analyzing trace with hash 551714658, now seen corresponding path program 1 times [2018-01-23 14:33:49,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:49,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:49,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:49,977 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:49,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:49,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:50,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:50,066 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:50,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:50,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:50,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:50,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-01-23 14:33:50,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:33:50,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:33:50,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:33:50,161 INFO L87 Difference]: Start difference. First operand 179 states and 202 transitions. Second operand 10 states. [2018-01-23 14:33:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:50,204 INFO L93 Difference]: Finished difference Result 300 states and 339 transitions. [2018-01-23 14:33:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:33:50,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-01-23 14:33:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:50,206 INFO L225 Difference]: With dead ends: 300 [2018-01-23 14:33:50,206 INFO L226 Difference]: Without dead ends: 274 [2018-01-23 14:33:50,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:33:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-23 14:33:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 189. [2018-01-23 14:33:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-23 14:33:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 214 transitions. [2018-01-23 14:33:50,215 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 214 transitions. Word has length 70 [2018-01-23 14:33:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:50,215 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 214 transitions. [2018-01-23 14:33:50,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:33:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2018-01-23 14:33:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-23 14:33:50,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:50,216 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:50,216 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 947921752, now seen corresponding path program 2 times [2018-01-23 14:33:50,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:50,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:50,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:50,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:50,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:50,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:50,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:50,298 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:50,313 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:33:50,329 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:50,340 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:50,342 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:50,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:50,412 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:50,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-23 14:33:50,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:33:50,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:33:50,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:33:50,413 INFO L87 Difference]: Start difference. First operand 189 states and 214 transitions. Second operand 12 states. [2018-01-23 14:33:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:50,486 INFO L93 Difference]: Finished difference Result 286 states and 319 transitions. [2018-01-23 14:33:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-23 14:33:50,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-01-23 14:33:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:50,488 INFO L225 Difference]: With dead ends: 286 [2018-01-23 14:33:50,489 INFO L226 Difference]: Without dead ends: 264 [2018-01-23 14:33:50,489 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:33:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-23 14:33:50,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 199. [2018-01-23 14:33:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-23 14:33:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 224 transitions. [2018-01-23 14:33:50,502 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 224 transitions. Word has length 75 [2018-01-23 14:33:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:50,502 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 224 transitions. [2018-01-23 14:33:50,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:33:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 224 transitions. [2018-01-23 14:33:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-23 14:33:50,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:50,504 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:50,504 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1425638509, now seen corresponding path program 2 times [2018-01-23 14:33:50,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:50,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:50,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:50,505 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:50,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:50,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:50,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:50,587 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:50,594 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:33:50,611 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:50,625 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:50,628 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:50,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:50,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:50,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-23 14:33:50,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-23 14:33:50,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-23 14:33:50,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=70, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:33:50,701 INFO L87 Difference]: Start difference. First operand 199 states and 224 transitions. Second operand 12 states. [2018-01-23 14:33:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:50,833 INFO L93 Difference]: Finished difference Result 401 states and 450 transitions. [2018-01-23 14:33:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:33:50,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-01-23 14:33:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:50,836 INFO L225 Difference]: With dead ends: 401 [2018-01-23 14:33:50,836 INFO L226 Difference]: Without dead ends: 375 [2018-01-23 14:33:50,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=70, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:33:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-23 14:33:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 209. [2018-01-23 14:33:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-23 14:33:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 236 transitions. [2018-01-23 14:33:50,851 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 236 transitions. Word has length 75 [2018-01-23 14:33:50,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:50,851 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 236 transitions. [2018-01-23 14:33:50,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-23 14:33:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 236 transitions. [2018-01-23 14:33:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:33:50,853 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:50,853 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:50,853 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1425278094, now seen corresponding path program 3 times [2018-01-23 14:33:50,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:50,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:50,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:50,854 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:50,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:50,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:50,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:50,953 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:50,966 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:33:50,986 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:50,995 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,002 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,007 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,012 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,018 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,019 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:51,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:51,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:51,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-23 14:33:51,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-23 14:33:51,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-23 14:33:51,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:33:51,145 INFO L87 Difference]: Start difference. First operand 209 states and 236 transitions. Second operand 14 states. [2018-01-23 14:33:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:51,259 INFO L93 Difference]: Finished difference Result 329 states and 366 transitions. [2018-01-23 14:33:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:33:51,259 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-01-23 14:33:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:51,261 INFO L225 Difference]: With dead ends: 329 [2018-01-23 14:33:51,262 INFO L226 Difference]: Without dead ends: 307 [2018-01-23 14:33:51,262 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:33:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-23 14:33:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 219. [2018-01-23 14:33:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-23 14:33:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 246 transitions. [2018-01-23 14:33:51,277 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 246 transitions. Word has length 80 [2018-01-23 14:33:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:51,278 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 246 transitions. [2018-01-23 14:33:51,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-23 14:33:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 246 transitions. [2018-01-23 14:33:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:33:51,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:51,279 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:51,280 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1802145815, now seen corresponding path program 3 times [2018-01-23 14:33:51,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:51,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:51,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:51,282 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:51,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:51,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:51,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:51,472 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:51,479 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:33:51,497 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,518 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,528 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,539 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:51,541 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:51,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:51,582 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 6 treesize of output 5 [2018-01-23 14:33:51,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:33:51,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:33:51,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:33:51,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:33:51,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-23 14:33:51,774 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 13 treesize of output 10 [2018-01-23 14:33:51,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:33:51,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,805 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 13 treesize of output 10 [2018-01-23 14:33:51,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:33:51,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-01-23 14:33:51,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-01-23 14:33:51,953 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 20 treesize of output 19 [2018-01-23 14:33:51,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 114 [2018-01-23 14:33:51,986 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 36 treesize of output 1 [2018-01-23 14:33:51,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:51,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 75 [2018-01-23 14:33:52,016 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 36 treesize of output 1 [2018-01-23 14:33:52,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,031 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:142, output treesize:42 [2018-01-23 14:33:52,084 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 38 treesize of output 32 [2018-01-23 14:33:52,099 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 32 treesize of output 17 [2018-01-23 14:33:52,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:39 [2018-01-23 14:33:52,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2018-01-23 14:33:52,161 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 11 treesize of output 3 [2018-01-23 14:33:52,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:52,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2018-01-23 14:33:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-01-23 14:33:52,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:52,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2018-01-23 14:33:52,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-23 14:33:52,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-23 14:33:52,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-01-23 14:33:52,218 INFO L87 Difference]: Start difference. First operand 219 states and 246 transitions. Second operand 21 states. [2018-01-23 14:33:53,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:53,725 INFO L93 Difference]: Finished difference Result 474 states and 525 transitions. [2018-01-23 14:33:53,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-23 14:33:53,726 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-01-23 14:33:53,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:53,728 INFO L225 Difference]: With dead ends: 474 [2018-01-23 14:33:53,728 INFO L226 Difference]: Without dead ends: 427 [2018-01-23 14:33:53,730 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=587, Invalid=2065, Unknown=0, NotChecked=0, Total=2652 [2018-01-23 14:33:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-01-23 14:33:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 229. [2018-01-23 14:33:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-23 14:33:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 257 transitions. [2018-01-23 14:33:53,746 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 257 transitions. Word has length 80 [2018-01-23 14:33:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:53,746 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 257 transitions. [2018-01-23 14:33:53,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-23 14:33:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 257 transitions. [2018-01-23 14:33:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-23 14:33:53,747 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:53,748 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:53,748 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash -628808808, now seen corresponding path program 4 times [2018-01-23 14:33:53,748 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:53,748 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:53,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:53,749 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:53,749 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:53,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:53,882 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:53,882 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:53,891 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:33:53,935 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:53,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:53,945 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 6 treesize of output 5 [2018-01-23 14:33:53,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:53,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:53,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:33:53,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:33:54,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:33:54,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:33:54,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-23 14:33:54,040 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 13 treesize of output 10 [2018-01-23 14:33:54,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:33:54,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,077 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 13 treesize of output 10 [2018-01-23 14:33:54,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:33:54,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,091 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:17 [2018-01-23 14:33:54,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-01-23 14:33:54,154 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 20 treesize of output 19 [2018-01-23 14:33:54,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 111 [2018-01-23 14:33:54,179 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 36 treesize of output 1 [2018-01-23 14:33:54,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-01-23 14:33:54,204 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 36 treesize of output 1 [2018-01-23 14:33:54,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,217 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,222 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-01-23 14:33:54,300 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 39 treesize of output 33 [2018-01-23 14:33:54,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-23 14:33:54,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-23 14:33:54,314 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 19 treesize of output 7 [2018-01-23 14:33:54,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2018-01-23 14:33:54,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:33:54,385 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 11 treesize of output 3 [2018-01-23 14:33:54,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:54,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-23 14:33:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-23 14:33:54,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:54,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2018-01-23 14:33:54,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-23 14:33:54,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-23 14:33:54,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:33:54,483 INFO L87 Difference]: Start difference. First operand 229 states and 257 transitions. Second operand 22 states. [2018-01-23 14:33:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:55,352 INFO L93 Difference]: Finished difference Result 409 states and 451 transitions. [2018-01-23 14:33:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-23 14:33:55,352 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-01-23 14:33:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:55,354 INFO L225 Difference]: With dead ends: 409 [2018-01-23 14:33:55,354 INFO L226 Difference]: Without dead ends: 347 [2018-01-23 14:33:55,355 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=480, Invalid=1590, Unknown=0, NotChecked=0, Total=2070 [2018-01-23 14:33:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-01-23 14:33:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 234. [2018-01-23 14:33:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-23 14:33:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 261 transitions. [2018-01-23 14:33:55,364 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 261 transitions. Word has length 85 [2018-01-23 14:33:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:55,364 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 261 transitions. [2018-01-23 14:33:55,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-23 14:33:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 261 transitions. [2018-01-23 14:33:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-23 14:33:55,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:55,365 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:55,365 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash 875164136, now seen corresponding path program 4 times [2018-01-23 14:33:55,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:55,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:55,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:55,366 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:55,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:55,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:55,470 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:55,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:55,471 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:55,475 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:33:55,501 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:55,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:55,506 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 6 treesize of output 5 [2018-01-23 14:33:55,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:33:55,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:33:55,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:33:55,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:33:55,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-23 14:33:55,559 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 13 treesize of output 10 [2018-01-23 14:33:55,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:33:55,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,572 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 13 treesize of output 10 [2018-01-23 14:33:55,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:33:55,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,580 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:17 [2018-01-23 14:33:55,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-01-23 14:33:55,626 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 36 treesize of output 1 [2018-01-23 14:33:55,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-01-23 14:33:55,640 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 20 treesize of output 19 [2018-01-23 14:33:55,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 66 [2018-01-23 14:33:55,656 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 36 treesize of output 1 [2018-01-23 14:33:55,656 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,662 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-01-23 14:33:55,702 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 39 treesize of output 33 [2018-01-23 14:33:55,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-23 14:33:55,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-23 14:33:55,716 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 19 treesize of output 7 [2018-01-23 14:33:55,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,722 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2018-01-23 14:33:55,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:33:55,754 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 11 treesize of output 3 [2018-01-23 14:33:55,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:33:55,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-23 14:33:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-23 14:33:55,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:55,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2018-01-23 14:33:55,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-23 14:33:55,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-23 14:33:55,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:33:55,798 INFO L87 Difference]: Start difference. First operand 234 states and 261 transitions. Second operand 22 states. [2018-01-23 14:33:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:56,922 INFO L93 Difference]: Finished difference Result 472 states and 524 transitions. [2018-01-23 14:33:56,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-23 14:33:56,939 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-01-23 14:33:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:56,941 INFO L225 Difference]: With dead ends: 472 [2018-01-23 14:33:56,941 INFO L226 Difference]: Without dead ends: 397 [2018-01-23 14:33:56,942 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=663, Invalid=2417, Unknown=0, NotChecked=0, Total=3080 [2018-01-23 14:33:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-23 14:33:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 209. [2018-01-23 14:33:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-23 14:33:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2018-01-23 14:33:56,953 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 85 [2018-01-23 14:33:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:56,954 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2018-01-23 14:33:56,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-23 14:33:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2018-01-23 14:33:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-23 14:33:56,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:56,955 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:56,955 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1256975908, now seen corresponding path program 1 times [2018-01-23 14:33:56,956 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:56,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:56,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:56,957 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:56,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:56,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:33:57,074 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:57,074 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:57,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:57,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:33:57,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:57,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-23 14:33:57,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-23 14:33:57,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-23 14:33:57,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=131, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:33:57,303 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand 16 states. [2018-01-23 14:33:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:57,395 INFO L93 Difference]: Finished difference Result 454 states and 507 transitions. [2018-01-23 14:33:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-23 14:33:57,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2018-01-23 14:33:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:57,397 INFO L225 Difference]: With dead ends: 454 [2018-01-23 14:33:57,397 INFO L226 Difference]: Without dead ends: 438 [2018-01-23 14:33:57,398 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=131, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:33:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-01-23 14:33:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 209. [2018-01-23 14:33:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-23 14:33:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2018-01-23 14:33:57,404 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 89 [2018-01-23 14:33:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:57,405 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2018-01-23 14:33:57,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-23 14:33:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2018-01-23 14:33:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-23 14:33:57,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:57,405 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:57,406 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash -969822206, now seen corresponding path program 1 times [2018-01-23 14:33:57,406 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:57,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:57,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:57,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:57,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:57,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-01-23 14:33:57,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:57,733 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:57,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:57,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-23 14:33:57,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:57,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-01-23 14:33:57,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-23 14:33:57,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-23 14:33:57,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:33:57,918 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand 22 states. [2018-01-23 14:33:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:58,723 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2018-01-23 14:33:58,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:33:58,724 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-01-23 14:33:58,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:58,725 INFO L225 Difference]: With dead ends: 353 [2018-01-23 14:33:58,725 INFO L226 Difference]: Without dead ends: 288 [2018-01-23 14:33:58,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1564, Unknown=0, NotChecked=0, Total=1980 [2018-01-23 14:33:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-23 14:33:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 161. [2018-01-23 14:33:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-23 14:33:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2018-01-23 14:33:58,731 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 90 [2018-01-23 14:33:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:58,731 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2018-01-23 14:33:58,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-23 14:33:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2018-01-23 14:33:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-23 14:33:58,732 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:58,732 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:58,732 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash 454315264, now seen corresponding path program 2 times [2018-01-23 14:33:58,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:58,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:58,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:58,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:33:58,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:58,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:33:58,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:58,875 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:58,880 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:33:58,896 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:58,911 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:33:58,916 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:33:58,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:33:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:33:59,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:33:59,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-23 14:33:59,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-23 14:33:59,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-23 14:33:59,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:33:59,001 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand 18 states. [2018-01-23 14:33:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:33:59,130 INFO L93 Difference]: Finished difference Result 464 states and 523 transitions. [2018-01-23 14:33:59,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-23 14:33:59,131 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-01-23 14:33:59,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:33:59,132 INFO L225 Difference]: With dead ends: 464 [2018-01-23 14:33:59,132 INFO L226 Difference]: Without dead ends: 446 [2018-01-23 14:33:59,133 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:33:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-01-23 14:33:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 166. [2018-01-23 14:33:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-23 14:33:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2018-01-23 14:33:59,139 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 94 [2018-01-23 14:33:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:33:59,139 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2018-01-23 14:33:59,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-23 14:33:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2018-01-23 14:33:59,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-23 14:33:59,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:33:59,140 INFO L322 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:33:59,140 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:33:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash 996948175, now seen corresponding path program 3 times [2018-01-23 14:33:59,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:33:59,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:33:59,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:59,141 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:33:59,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:33:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:33:59,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:33:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 7 proven. 50 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-01-23 14:33:59,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:33:59,952 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:33:59,957 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:33:59,971 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:59,977 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:59,996 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:33:59,998 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:00,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:00,214 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 13 treesize of output 10 [2018-01-23 14:34:00,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:00,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:00,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:00,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:00,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:40 [2018-01-23 14:34:00,278 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 45 treesize of output 39 [2018-01-23 14:34:00,280 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 39 treesize of output 24 [2018-01-23 14:34:00,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:00,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:00,288 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-01-23 14:34:00,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2018-01-23 14:34:00,479 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 Int) (main_~p~7.base Int) (v_subst_1 Int)) (let ((.cse0 (store (store |c_old(#valid)| main_~p~7.base 1) v_prenex_1 1))) (and (= |c_#valid| (store (store .cse0 v_subst_1 1) main_~p~7.base 0)) (= 0 (select .cse0 v_subst_1)) (not (= 0 main_~p~7.base))))) is different from true [2018-01-23 14:34:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 10 refuted. 9 times theorem prover too weak. 164 trivial. 0 not checked. [2018-01-23 14:34:00,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:00,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 32 [2018-01-23 14:34:00,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-23 14:34:00,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-23 14:34:00,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=800, Unknown=33, NotChecked=58, Total=992 [2018-01-23 14:34:00,539 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand 32 states. [2018-01-23 14:34:01,152 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 103 DAG size of output 79 [2018-01-23 14:34:01,331 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 95 DAG size of output 71 [2018-01-23 14:34:01,800 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 112 DAG size of output 90 [2018-01-23 14:34:02,220 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 114 DAG size of output 90 [2018-01-23 14:34:02,455 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 75 DAG size of output 65 [2018-01-23 14:34:02,774 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 92 DAG size of output 77 [2018-01-23 14:34:02,923 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 84 DAG size of output 69 [2018-01-23 14:34:03,463 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 101 DAG size of output 80 [2018-01-23 14:34:03,723 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 107 DAG size of output 81 [2018-01-23 14:34:04,094 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 115 DAG size of output 80 [2018-01-23 14:34:04,352 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 121 DAG size of output 82 [2018-01-23 14:34:04,746 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-01-23 14:34:05,436 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 84 DAG size of output 63 [2018-01-23 14:34:06,143 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 98 DAG size of output 67 [2018-01-23 14:34:06,488 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 83 DAG size of output 63 [2018-01-23 14:34:06,721 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-01-23 14:34:06,920 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 74 DAG size of output 62 [2018-01-23 14:34:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:08,865 INFO L93 Difference]: Finished difference Result 640 states and 717 transitions. [2018-01-23 14:34:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-23 14:34:08,865 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2018-01-23 14:34:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:08,867 INFO L225 Difference]: With dead ends: 640 [2018-01-23 14:34:08,867 INFO L226 Difference]: Without dead ends: 629 [2018-01-23 14:34:08,868 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1065, Invalid=5497, Unknown=84, NotChecked=160, Total=6806 [2018-01-23 14:34:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-01-23 14:34:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 304. [2018-01-23 14:34:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-01-23 14:34:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 342 transitions. [2018-01-23 14:34:08,892 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 342 transitions. Word has length 99 [2018-01-23 14:34:08,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:08,892 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 342 transitions. [2018-01-23 14:34:08,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-23 14:34:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 342 transitions. [2018-01-23 14:34:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-23 14:34:08,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:08,894 INFO L322 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:08,894 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash 46358264, now seen corresponding path program 5 times [2018-01-23 14:34:08,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:08,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:08,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:08,895 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:08,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:08,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:34:09,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:09,057 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:09,065 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-23 14:34:09,082 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,084 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,087 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,089 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,092 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,095 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,101 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,112 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,143 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:09,145 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:09,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:34:09,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:09,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-23 14:34:09,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-23 14:34:09,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-23 14:34:09,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:34:09,347 INFO L87 Difference]: Start difference. First operand 304 states and 342 transitions. Second operand 20 states. [2018-01-23 14:34:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:09,481 INFO L93 Difference]: Finished difference Result 497 states and 552 transitions. [2018-01-23 14:34:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-23 14:34:09,481 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2018-01-23 14:34:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:09,483 INFO L225 Difference]: With dead ends: 497 [2018-01-23 14:34:09,483 INFO L226 Difference]: Without dead ends: 475 [2018-01-23 14:34:09,484 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-01-23 14:34:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-01-23 14:34:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 314. [2018-01-23 14:34:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-23 14:34:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 352 transitions. [2018-01-23 14:34:09,511 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 352 transitions. Word has length 106 [2018-01-23 14:34:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:09,512 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 352 transitions. [2018-01-23 14:34:09,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-23 14:34:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 352 transitions. [2018-01-23 14:34:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-23 14:34:09,513 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:09,513 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:09,513 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash 417027715, now seen corresponding path program 3 times [2018-01-23 14:34:09,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:09,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:09,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:09,515 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:09,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:09,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:34:09,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:09,662 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:09,671 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:34:09,695 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:34:09,707 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:34:09,722 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:34:09,727 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:09,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:09,735 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 6 treesize of output 5 [2018-01-23 14:34:09,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:34:09,785 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 11 treesize of output 8 [2018-01-23 14:34:09,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:09,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-23 14:34:09,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:09,813 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:09,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:34:09,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-23 14:34:09,853 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 13 treesize of output 10 [2018-01-23 14:34:09,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:09,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-23 14:34:09,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:09,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-23 14:34:09,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,888 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-23 14:34:09,913 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-01-23 14:34:09,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-01-23 14:34:09,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-23 14:34:09,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:34:09,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:09,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:09,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-23 14:34:10,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:10,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:10,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-23 14:34:10,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:10,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-23 14:34:10,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:31 [2018-01-23 14:34:10,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-23 14:34:10,080 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 15 treesize of output 3 [2018-01-23 14:34:10,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,087 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-01-23 14:34:10,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-01-23 14:34:10,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:10,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-01-23 14:34:10,182 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-23 14:34:10,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:10,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-01-23 14:34:10,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:34:10,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-23 14:34:10,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:10,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-01-23 14:34:10,317 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:34:10,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-01-23 14:34:10,349 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-01-23 14:34:10,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:10,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-01-23 14:34:10,443 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-01-23 14:34:10,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,448 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 11 treesize of output 3 [2018-01-23 14:34:10,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-23 14:34:10,461 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 5 treesize of output 1 [2018-01-23 14:34:10,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,465 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 11 treesize of output 3 [2018-01-23 14:34:10,465 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:10,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:10,472 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:7 [2018-01-23 14:34:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-01-23 14:34:10,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:10,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 29 [2018-01-23 14:34:10,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-23 14:34:10,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-23 14:34:10,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:34:10,525 INFO L87 Difference]: Start difference. First operand 314 states and 352 transitions. Second operand 29 states. [2018-01-23 14:34:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:12,326 INFO L93 Difference]: Finished difference Result 733 states and 813 transitions. [2018-01-23 14:34:12,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-23 14:34:12,326 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 106 [2018-01-23 14:34:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:12,328 INFO L225 Difference]: With dead ends: 733 [2018-01-23 14:34:12,328 INFO L226 Difference]: Without dead ends: 631 [2018-01-23 14:34:12,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=919, Invalid=4051, Unknown=0, NotChecked=0, Total=4970 [2018-01-23 14:34:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-01-23 14:34:12,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 344. [2018-01-23 14:34:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-23 14:34:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 387 transitions. [2018-01-23 14:34:12,348 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 387 transitions. Word has length 106 [2018-01-23 14:34:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:12,348 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 387 transitions. [2018-01-23 14:34:12,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-23 14:34:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 387 transitions. [2018-01-23 14:34:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-23 14:34:12,349 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:12,349 INFO L322 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:12,349 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:12,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1851980846, now seen corresponding path program 6 times [2018-01-23 14:34:12,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:12,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:12,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:12,350 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:12,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:12,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:34:12,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:12,653 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:12,660 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-23 14:34:12,678 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:12,682 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:12,689 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:12,696 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:12,706 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:12,711 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:12,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:12,820 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 13 treesize of output 10 [2018-01-23 14:34:12,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:12,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:12,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:12,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:12,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:43 [2018-01-23 14:34:12,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:12,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-01-23 14:34:12,961 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 12 treesize of output 1 [2018-01-23 14:34:12,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:12,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:12,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:12,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:46 [2018-01-23 14:34:13,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:13,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-01-23 14:34:13,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:13,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:13,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:13,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:13,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:78 [2018-01-23 14:34:13,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:13,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:13,236 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:13,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 134 [2018-01-23 14:34:13,248 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 36 treesize of output 1 [2018-01-23 14:34:13,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:13,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:13,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:13,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:81 [2018-01-23 14:34:13,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:13,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-01-23 14:34:13,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-01-23 14:34:13,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:13,441 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 43 treesize of output 32 [2018-01-23 14:34:13,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:13,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:13,452 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-01-23 14:34:13,452 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:36 [2018-01-23 14:34:13,541 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_15 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~7.base 1))) (let ((.cse1 (store .cse0 c_main_~t~7.base 1))) (and (= 0 (select .cse0 c_main_~t~7.base)) (not (= 0 main_~p~7.base)) (= (select .cse1 v_prenex_15) 0) (= (store (store .cse1 v_prenex_15 1) main_~p~7.base 0) |c_#valid|))))) is different from true [2018-01-23 14:34:13,544 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_15 Int) (v_subst_2 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_2 1))) (let ((.cse0 (store .cse1 c_main_~p~7.base 1))) (and (= 0 (select .cse0 v_prenex_15)) (not (= 0 v_subst_2)) (= 0 (select .cse1 c_main_~p~7.base)) (= |c_#valid| (store (store .cse0 v_prenex_15 1) v_subst_2 0)))))) is different from true [2018-01-23 14:34:13,560 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_16 Int) (v_prenex_17 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_17 1))) (let ((.cse0 (store .cse1 main_~p~7.base 1))) (and (not (= 0 v_prenex_17)) (= 0 (select .cse0 v_prenex_16)) (= |c_#valid| (store (store (store .cse0 v_prenex_16 1) v_prenex_17 0) main_~p~7.base 0)) (= 0 (select .cse1 main_~p~7.base)) (not (= 0 main_~p~7.base)))))) (exists ((v_prenex_15 Int) (v_subst_2 Int)) (let ((.cse3 (store |c_old(#valid)| v_subst_2 1))) (let ((.cse2 (store .cse3 0 1))) (and (not (= 0 v_subst_2)) (= 0 (select .cse2 v_prenex_15)) (= |c_#valid| (store (store .cse2 v_prenex_15 1) v_subst_2 0)) (= 0 (select .cse3 0)))))) (exists ((v_prenex_18 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (let ((.cse4 (store |c_old(#valid)| v_prenex_20 1))) (let ((.cse5 (store .cse4 v_prenex_19 1))) (and (= 0 (select .cse4 v_prenex_19)) (= 0 (select .cse5 v_prenex_18)) (= |c_#valid| (store (store .cse5 v_prenex_18 1) v_prenex_20 0)) (= 0 (select |c_#valid| v_prenex_19)) (not (= 0 v_prenex_20))))))) is different from true [2018-01-23 14:34:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 207 trivial. 3 not checked. [2018-01-23 14:34:13,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:13,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24] total 35 [2018-01-23 14:34:13,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-23 14:34:13,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-23 14:34:13,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=884, Unknown=3, NotChecked=186, Total=1190 [2018-01-23 14:34:13,657 INFO L87 Difference]: Start difference. First operand 344 states and 387 transitions. Second operand 35 states. [2018-01-23 14:34:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:16,700 INFO L93 Difference]: Finished difference Result 614 states and 676 transitions. [2018-01-23 14:34:16,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-23 14:34:16,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 111 [2018-01-23 14:34:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:16,702 INFO L225 Difference]: With dead ends: 614 [2018-01-23 14:34:16,702 INFO L226 Difference]: Without dead ends: 587 [2018-01-23 14:34:16,703 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=979, Invalid=5131, Unknown=64, NotChecked=468, Total=6642 [2018-01-23 14:34:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-01-23 14:34:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 417. [2018-01-23 14:34:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-01-23 14:34:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 461 transitions. [2018-01-23 14:34:16,738 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 461 transitions. Word has length 111 [2018-01-23 14:34:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:16,739 INFO L432 AbstractCegarLoop]: Abstraction has 417 states and 461 transitions. [2018-01-23 14:34:16,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-23 14:34:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 461 transitions. [2018-01-23 14:34:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-23 14:34:16,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:16,741 INFO L322 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:16,741 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1032085417, now seen corresponding path program 1 times [2018-01-23 14:34:16,741 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:16,741 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:16,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:16,742 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:16,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:16,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:34:16,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:16,948 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:16,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:17,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:34:17,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:17,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-23 14:34:17,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-23 14:34:17,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-23 14:34:17,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=260, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:34:17,225 INFO L87 Difference]: Start difference. First operand 417 states and 461 transitions. Second operand 22 states. [2018-01-23 14:34:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:17,345 INFO L93 Difference]: Finished difference Result 871 states and 963 transitions. [2018-01-23 14:34:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-23 14:34:17,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-01-23 14:34:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:17,348 INFO L225 Difference]: With dead ends: 871 [2018-01-23 14:34:17,348 INFO L226 Difference]: Without dead ends: 845 [2018-01-23 14:34:17,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=260, Unknown=0, NotChecked=0, Total=462 [2018-01-23 14:34:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-01-23 14:34:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 427. [2018-01-23 14:34:17,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-01-23 14:34:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 473 transitions. [2018-01-23 14:34:17,383 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 473 transitions. Word has length 111 [2018-01-23 14:34:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:17,383 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 473 transitions. [2018-01-23 14:34:17,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-23 14:34:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 473 transitions. [2018-01-23 14:34:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-23 14:34:17,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:17,384 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:17,384 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1275428872, now seen corresponding path program 1 times [2018-01-23 14:34:17,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:17,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:17,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:17,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:17,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:17,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-01-23 14:34:17,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:17,929 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:17,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:17,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:34:18,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:18,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2018-01-23 14:34:18,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-23 14:34:18,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-23 14:34:18,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2018-01-23 14:34:18,254 INFO L87 Difference]: Start difference. First operand 427 states and 473 transitions. Second operand 34 states. [2018-01-23 14:34:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:20,417 INFO L93 Difference]: Finished difference Result 857 states and 937 transitions. [2018-01-23 14:34:20,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-23 14:34:20,418 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 116 [2018-01-23 14:34:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:20,419 INFO L225 Difference]: With dead ends: 857 [2018-01-23 14:34:20,419 INFO L226 Difference]: Without dead ends: 770 [2018-01-23 14:34:20,421 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1382, Invalid=7548, Unknown=0, NotChecked=0, Total=8930 [2018-01-23 14:34:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-01-23 14:34:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 447. [2018-01-23 14:34:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-01-23 14:34:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 493 transitions. [2018-01-23 14:34:20,445 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 493 transitions. Word has length 116 [2018-01-23 14:34:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:20,445 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 493 transitions. [2018-01-23 14:34:20,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-23 14:34:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 493 transitions. [2018-01-23 14:34:20,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-23 14:34:20,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:20,447 INFO L322 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:20,447 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:20,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1912718803, now seen corresponding path program 2 times [2018-01-23 14:34:20,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:20,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:20,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:20,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:20,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:20,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:34:20,565 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:20,565 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:20,570 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:34:20,587 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:20,602 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:20,605 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:20,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:20,691 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:34:20,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:20,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-23 14:34:20,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-23 14:34:20,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-23 14:34:20,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=313, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:34:20,712 INFO L87 Difference]: Start difference. First operand 447 states and 493 transitions. Second operand 24 states. [2018-01-23 14:34:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:20,865 INFO L93 Difference]: Finished difference Result 956 states and 1056 transitions. [2018-01-23 14:34:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-23 14:34:20,865 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 116 [2018-01-23 14:34:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:20,867 INFO L225 Difference]: With dead ends: 956 [2018-01-23 14:34:20,867 INFO L226 Difference]: Without dead ends: 930 [2018-01-23 14:34:20,868 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=239, Invalid=313, Unknown=0, NotChecked=0, Total=552 [2018-01-23 14:34:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-01-23 14:34:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 457. [2018-01-23 14:34:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-01-23 14:34:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2018-01-23 14:34:20,893 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 116 [2018-01-23 14:34:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:20,893 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2018-01-23 14:34:20,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-23 14:34:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2018-01-23 14:34:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-23 14:34:20,894 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:20,895 INFO L322 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:20,895 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2099490263, now seen corresponding path program 3 times [2018-01-23 14:34:20,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:20,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:20,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:20,896 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:20,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:20,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 258 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-23 14:34:21,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:21,062 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:21,067 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:34:21,085 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:34:21,096 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:34:21,100 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:21,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:21,219 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 13 treesize of output 10 [2018-01-23 14:34:21,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:21,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:43 [2018-01-23 14:34:21,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:21,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-01-23 14:34:21,303 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 12 treesize of output 1 [2018-01-23 14:34:21,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:46 [2018-01-23 14:34:21,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:21,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 73 [2018-01-23 14:34:21,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:21,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:78 [2018-01-23 14:34:21,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:21,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:21,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:21,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 134 [2018-01-23 14:34:21,522 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 36 treesize of output 1 [2018-01-23 14:34:21,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:21,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:81 [2018-01-23 14:34:21,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:21,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 76 [2018-01-23 14:34:21,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-01-23 14:34:21,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:21,826 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 43 treesize of output 32 [2018-01-23 14:34:21,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:21,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-23 14:34:21,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:34:21,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,869 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 88 [2018-01-23 14:34:21,893 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 5 treesize of output 1 [2018-01-23 14:34:21,893 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,902 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:21,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67 [2018-01-23 14:34:21,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2018-01-23 14:34:21,926 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:21,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-01-23 14:34:21,935 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:21,941 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:21,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:34:21,959 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:181, output treesize:81 [2018-01-23 14:34:22,088 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~t~7.base 0)) (exists ((v_arrayElimCell_60 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| main_~p~7.base 1))) (let ((.cse0 (store .cse1 c_main_~t~7.base 1))) (and (= (select .cse0 v_arrayElimCell_60) 0) (= 0 (select .cse1 c_main_~t~7.base)) (not (= 0 main_~p~7.base)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_60 1) main_~p~7.base 0))))))) (and (not (= c_main_~t~7.offset 0)) (exists ((v_prenex_26 Int) (v_arrayElimCell_55 Int)) (let ((.cse3 (store |c_old(#valid)| v_prenex_26 1))) (let ((.cse2 (store .cse3 c_main_~t~7.base 1))) (and (= (select .cse2 v_arrayElimCell_55) 0) (not (= 0 v_prenex_26)) (= (store (store .cse2 v_arrayElimCell_55 1) v_prenex_26 0) |c_#valid|) (= 0 (select .cse3 c_main_~t~7.base)))))))) is different from true [2018-01-23 14:34:22,175 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_60 Int) (v_subst_3 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_3 1))) (let ((.cse0 (store .cse1 main_~p~7.base 1))) (and (= (select .cse0 v_arrayElimCell_60) 0) (not (= 0 v_subst_3)) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_60 1) v_subst_3 0) main_~p~7.base 0)) (not (= 0 main_~p~7.base)) (= (select .cse1 main_~p~7.base) 0))))) is different from true [2018-01-23 14:34:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-01-23 14:34:22,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:22,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26] total 38 [2018-01-23 14:34:22,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-23 14:34:22,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-23 14:34:22,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1116, Unknown=5, NotChecked=138, Total=1406 [2018-01-23 14:34:22,286 INFO L87 Difference]: Start difference. First operand 457 states and 505 transitions. Second operand 38 states. [2018-01-23 14:34:25,217 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 85 DAG size of output 83 [2018-01-23 14:34:25,524 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 85 DAG size of output 83 [2018-01-23 14:34:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:25,741 INFO L93 Difference]: Finished difference Result 950 states and 1053 transitions. [2018-01-23 14:34:25,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-23 14:34:25,741 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 121 [2018-01-23 14:34:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:25,743 INFO L225 Difference]: With dead ends: 950 [2018-01-23 14:34:25,743 INFO L226 Difference]: Without dead ends: 923 [2018-01-23 14:34:25,745 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=741, Invalid=4503, Unknown=20, NotChecked=286, Total=5550 [2018-01-23 14:34:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-01-23 14:34:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 536. [2018-01-23 14:34:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-01-23 14:34:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 600 transitions. [2018-01-23 14:34:25,785 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 600 transitions. Word has length 121 [2018-01-23 14:34:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:25,785 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 600 transitions. [2018-01-23 14:34:25,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-23 14:34:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 600 transitions. [2018-01-23 14:34:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-23 14:34:25,786 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:25,786 INFO L322 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:25,786 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash 91923843, now seen corresponding path program 5 times [2018-01-23 14:34:25,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:25,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:25,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:25,787 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:25,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:25,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 311 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:34:26,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:26,108 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:26,115 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-23 14:34:26,130 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,132 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,134 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,136 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,138 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,140 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,142 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,144 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,147 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,151 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,161 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,176 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:26,178 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:26,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 311 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:34:26,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:26,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-01-23 14:34:26,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-23 14:34:26,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-23 14:34:26,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=434, Unknown=0, NotChecked=0, Total=756 [2018-01-23 14:34:26,345 INFO L87 Difference]: Start difference. First operand 536 states and 600 transitions. Second operand 28 states. [2018-01-23 14:34:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:26,583 INFO L93 Difference]: Finished difference Result 1131 states and 1262 transitions. [2018-01-23 14:34:26,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-23 14:34:26,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 126 [2018-01-23 14:34:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:26,586 INFO L225 Difference]: With dead ends: 1131 [2018-01-23 14:34:26,586 INFO L226 Difference]: Without dead ends: 1093 [2018-01-23 14:34:26,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=322, Invalid=434, Unknown=0, NotChecked=0, Total=756 [2018-01-23 14:34:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-01-23 14:34:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 566. [2018-01-23 14:34:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-01-23 14:34:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 633 transitions. [2018-01-23 14:34:26,630 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 633 transitions. Word has length 126 [2018-01-23 14:34:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:26,630 INFO L432 AbstractCegarLoop]: Abstraction has 566 states and 633 transitions. [2018-01-23 14:34:26,630 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-23 14:34:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 633 transitions. [2018-01-23 14:34:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-23 14:34:26,631 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:26,631 INFO L322 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:26,631 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash 162733095, now seen corresponding path program 6 times [2018-01-23 14:34:26,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:26,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:26,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:26,632 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:26,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:26,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-23 14:34:26,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:26,951 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:26,964 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-23 14:34:26,983 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:26,988 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:26,996 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:27,003 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:27,018 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:34:27,023 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:27,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:27,188 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 13 treesize of output 10 [2018-01-23 14:34:27,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:27,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:27,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:27,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:27,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:48 [2018-01-23 14:34:27,244 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 45 treesize of output 39 [2018-01-23 14:34:27,246 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 39 treesize of output 24 [2018-01-23 14:34:27,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:27,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:27,257 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-01-23 14:34:27,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:36 [2018-01-23 14:34:27,452 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_29 Int) (v_prenex_28 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| main_~p~7.base 1))) (let ((.cse0 (store .cse1 v_prenex_28 1))) (and (= 0 (select .cse0 v_prenex_29)) (= (store (store .cse0 v_prenex_29 1) main_~p~7.base 0) |c_#valid|) (not (= 0 main_~p~7.base)) (= (select .cse1 v_prenex_28) 0))))) is different from true [2018-01-23 14:34:27,469 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_32 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_34 1))) (let ((.cse1 (store .cse0 v_prenex_33 1))) (and (= (select .cse0 v_prenex_33) 0) (= 0 (select .cse1 v_prenex_32)) (= |c_#valid| (store (store .cse1 v_prenex_32 1) v_prenex_34 0)) (not (= 0 v_prenex_34)))))) (exists ((v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int) (v_prenex_31 Int)) (let ((.cse3 (store |c_old(#valid)| v_prenex_31 1))) (let ((.cse2 (store .cse3 v_prenex_36 1))) (and (not (= 0 v_prenex_37)) (= 0 (select .cse2 v_prenex_35)) (= (store (store (store .cse2 v_prenex_35 1) v_prenex_31 0) v_prenex_37 0) |c_#valid|) (= (select .cse3 v_prenex_36) 0) (not (= 0 v_prenex_31)))))) (and (exists ((v_prenex_30 Int)) (= 0 (select |c_#valid| v_prenex_30))) (exists ((v_prenex_29 Int) (v_prenex_28 Int) (main_~p~7.base Int)) (let ((.cse5 (store |c_old(#valid)| main_~p~7.base 1))) (let ((.cse4 (store .cse5 v_prenex_28 1))) (and (= 0 (select .cse4 v_prenex_29)) (= (store (store .cse4 v_prenex_29 1) main_~p~7.base 0) |c_#valid|) (not (= 0 main_~p~7.base)) (= (select .cse5 v_prenex_28) 0))))))) is different from true [2018-01-23 14:34:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 10 refuted. 9 times theorem prover too weak. 369 trivial. 3 not checked. [2018-01-23 14:34:27,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:27,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-01-23 14:34:27,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-23 14:34:27,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-23 14:34:27,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=655, Unknown=10, NotChecked=110, Total=930 [2018-01-23 14:34:27,564 INFO L87 Difference]: Start difference. First operand 566 states and 633 transitions. Second operand 31 states. Received shutdown request... [2018-01-23 14:34:31,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-23 14:34:31,806 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:34:31,809 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:31,809 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:31,809 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:31,809 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:31,809 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:31,809 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:31,809 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:31,809 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:34:31,810 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-23 14:34:31,811 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:34:31,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:34:31 BoogieIcfgContainer [2018-01-23 14:34:31,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:34:31,814 INFO L168 Benchmark]: Toolchain (without parser) took 48335.40 ms. Allocated memory was 308.8 MB in the beginning and 798.5 MB in the end (delta: 489.7 MB). Free memory was 267.1 MB in the beginning and 487.6 MB in the end (delta: -220.4 MB). Peak memory consumption was 269.2 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:31,815 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 308.8 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:34:31,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.71 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 255.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:31,816 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 308.8 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:31,816 INFO L168 Benchmark]: RCFGBuilder took 337.47 ms. Allocated memory is still 308.8 MB. Free memory was 253.0 MB in the beginning and 230.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:31,816 INFO L168 Benchmark]: TraceAbstraction took 47736.34 ms. Allocated memory was 308.8 MB in the beginning and 798.5 MB in the end (delta: 489.7 MB). Free memory was 229.4 MB in the beginning and 487.6 MB in the end (delta: -258.2 MB). Peak memory consumption was 231.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:34:31,818 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 308.8 MB. Free memory is still 273.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.71 ms. Allocated memory is still 308.8 MB. Free memory was 266.1 MB in the beginning and 255.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 308.8 MB. Free memory was 255.0 MB in the beginning and 253.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 337.47 ms. Allocated memory is still 308.8 MB. Free memory was 253.0 MB in the beginning and 230.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47736.34 ms. Allocated memory was 308.8 MB in the beginning and 798.5 MB in the end (delta: 489.7 MB). Free memory was 229.4 MB in the beginning and 487.6 MB in the end (delta: -258.2 MB). Peak memory consumption was 231.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 72 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 11 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 72 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while BasicCegarLoop was constructing difference of abstraction (566states) and interpolant automaton (currently 66 states, 31 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 92 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 72 locations, 4 error locations. TIMEOUT Result, 47.4s OverallTime, 30 OverallIterations, 13 TraceHistogramMax, 31.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1860 SDtfs, 11908 SDslu, 20075 SDs, 0 SdLazy, 13302 SolverSat, 2567 SolverUnsat, 504 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3198 GetRequests, 2239 SyntacticMatches, 4 SemanticMatches, 954 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 13902 ImplicationChecksByTransitivity, 26.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 5045 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 4816 NumberOfCodeBlocks, 4638 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 4760 ConstructedInterpolants, 357 QuantifiedInterpolants, 4551825 SizeOfPredicates, 174 NumberOfNonLiveVariables, 6633 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 56 InterpolantComputations, 4 PerfectInterpolantSequences, 2310/6454 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while IsEmpty was searching accepting run (input had 69 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 72 locations, 4 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-34-31-827.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-34-31-827.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-34-31-827.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-34-31-827.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-34-31-827.csv Completed graceful shutdown