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-2f49842 [2018-01-20 22:07:44,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:07:44,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:07:44,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:07:44,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:07:44,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:07:44,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:07:44,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:07:44,173 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:07:44,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:07:44,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:07:44,175 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:07:44,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:07:44,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:07:44,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:07:44,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:07:44,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:07:44,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:07:44,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:07:44,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:07:44,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:07:44,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:07:44,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:07:44,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:07:44,191 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:07:44,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:07:44,192 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:07:44,193 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:07:44,193 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:07:44,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:07:44,194 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:07:44,194 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-20 22:07:44,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:07:44,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:07:44,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:07:44,205 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:07:44,205 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:07:44,205 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:07:44,205 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:07:44,206 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:07:44,206 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:07:44,206 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:07:44,206 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:07:44,207 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:07:44,207 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:07:44,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:07:44,207 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:07:44,207 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:07:44,207 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:07:44,208 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:07:44,208 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:07:44,208 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:07:44,208 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:07:44,208 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:07:44,209 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:07:44,209 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:07:44,209 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:07:44,209 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:07:44,209 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:07:44,209 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:07:44,210 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:07:44,210 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:07:44,210 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:07:44,210 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:07:44,210 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:07:44,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:07:44,210 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:07:44,211 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:07:44,211 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:07:44,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:07:44,258 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:07:44,261 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:07:44,262 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:07:44,262 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:07:44,263 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-20 22:07:44,411 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:07:44,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:07:44,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:07:44,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:07:44,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:07:44,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6479bd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44, skipping insertion in model container [2018-01-20 22:07:44,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,444 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:07:44,483 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:07:44,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:07:44,628 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:07:44,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44 WrapperNode [2018-01-20 22:07:44,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:07:44,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:07:44,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:07:44,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:07:44,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (1/1) ... [2018-01-20 22:07:44,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:07:44,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:07:44,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:07:44,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:07:44,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (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-20 22:07:44,719 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:07:44,719 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:07:44,719 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-20 22:07:44,719 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:07:44,719 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:07:44,719 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:07:44,720 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:07:44,721 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-20 22:07:44,721 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:07:44,721 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:07:44,721 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:07:45,004 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:07:45,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:07:45 BoogieIcfgContainer [2018-01-20 22:07:45,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:07:45,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:07:45,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:07:45,007 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:07:45,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:07:44" (1/3) ... [2018-01-20 22:07:45,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79624ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:07:45, skipping insertion in model container [2018-01-20 22:07:45,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:07:44" (2/3) ... [2018-01-20 22:07:45,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79624ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:07:45, skipping insertion in model container [2018-01-20 22:07:45,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:07:45" (3/3) ... [2018-01-20 22:07:45,011 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-01-20 22:07:45,021 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:07:45,028 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 22:07:45,072 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:45,072 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:45,072 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:45,072 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:45,073 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:45,073 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:45,073 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:45,073 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-20 22:07:45,073 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-20 22:07:45,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:07:45,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 69 states. [2018-01-20 22:07:45,176 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-20 22:07:45,177 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-20 22:07:45,177 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-20 22:07:45,177 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-20 22:07:45,177 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-20 22:07:45,177 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 671) no Hoare annotation was computed. [2018-01-20 22:07:45,177 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 671) no Hoare annotation was computed. [2018-01-20 22:07:45,178 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 671) the Hoare annotation is: true [2018-01-20 22:07:45,178 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 671) no Hoare annotation was computed. [2018-01-20 22:07:45,178 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 671) the Hoare annotation is: true [2018-01-20 22:07:45,178 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 671) no Hoare annotation was computed. [2018-01-20 22:07:45,178 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 671) the Hoare annotation is: true [2018-01-20 22:07:45,178 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 671) no Hoare annotation was computed. [2018-01-20 22:07:45,178 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 671) no Hoare annotation was computed. [2018-01-20 22:07:45,178 INFO L401 ceAbstractionStarter]: For program point L641'''''(lines 641 648) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L404 ceAbstractionStarter]: At program point L664'''(lines 664 668) the Hoare annotation is: true [2018-01-20 22:07:45,179 INFO L401 ceAbstractionStarter]: For program point L659'(line 659) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L401 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L401 ceAbstractionStarter]: For program point L664''''(lines 664 668) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L401 ceAbstractionStarter]: For program point L641''''''(lines 641 648) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 671) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L401 ceAbstractionStarter]: For program point L664'(line 664) no Hoare annotation was computed. [2018-01-20 22:07:45,179 INFO L404 ceAbstractionStarter]: At program point L653'''(lines 653 656) the Hoare annotation is: true [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L641(lines 641 648) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L401 ceAbstractionStarter]: For program point L657'(line 657) no Hoare annotation was computed. [2018-01-20 22:07:45,180 INFO L404 ceAbstractionStarter]: At program point L645'(line 645) the Hoare annotation is: true [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L637'''(line 637) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 671) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 640) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-20 22:07:45,181 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L661(line 661) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L661''(lines 661 662) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L645'''(line 645) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L665(line 665) no Hoare annotation was computed. [2018-01-20 22:07:45,182 INFO L401 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2018-01-20 22:07:45,183 INFO L401 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2018-01-20 22:07:45,183 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-20 22:07:45,183 INFO L401 ceAbstractionStarter]: For program point L643'(line 643) no Hoare annotation was computed. [2018-01-20 22:07:45,183 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 671) no Hoare annotation was computed. [2018-01-20 22:07:45,183 INFO L401 ceAbstractionStarter]: For program point L655(line 655) no Hoare annotation was computed. [2018-01-20 22:07:45,183 INFO L401 ceAbstractionStarter]: For program point L653(lines 653 656) no Hoare annotation was computed. [2018-01-20 22:07:45,183 INFO L401 ceAbstractionStarter]: For program point L659(line 659) no Hoare annotation was computed. [2018-01-20 22:07:45,184 INFO L401 ceAbstractionStarter]: For program point L657(lines 657 660) no Hoare annotation was computed. [2018-01-20 22:07:45,184 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 671) the Hoare annotation is: true [2018-01-20 22:07:45,184 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 640) the Hoare annotation is: true [2018-01-20 22:07:45,184 INFO L401 ceAbstractionStarter]: For program point L657'''(lines 657 660) no Hoare annotation was computed. [2018-01-20 22:07:45,184 INFO L401 ceAbstractionStarter]: For program point L657''''(lines 657 660) no Hoare annotation was computed. [2018-01-20 22:07:45,184 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-20 22:07:45,185 INFO L404 ceAbstractionStarter]: At program point L637'(line 637) the Hoare annotation is: true [2018-01-20 22:07:45,185 INFO L401 ceAbstractionStarter]: For program point L665'(line 665) no Hoare annotation was computed. [2018-01-20 22:07:45,185 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-20 22:07:45,185 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-20 22:07:45,185 INFO L401 ceAbstractionStarter]: For program point L641'(line 641) no Hoare annotation was computed. [2018-01-20 22:07:45,186 INFO L401 ceAbstractionStarter]: For program point L641'''(line 641) no Hoare annotation was computed. [2018-01-20 22:07:45,186 INFO L401 ceAbstractionStarter]: For program point L666'(line 666) no Hoare annotation was computed. [2018-01-20 22:07:45,190 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:45,191 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:45,191 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:45,191 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:45,191 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:45,191 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:45,192 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:45,192 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:07:45,192 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-20 22:07:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:07:45,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:45,197 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:07:45,197 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:07:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash 187264, now seen corresponding path program 1 times [2018-01-20 22:07:45,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:45,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:45,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:45,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:07:45,285 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:07:45,291 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:07:45,295 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:07:45,296 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:07:45,296 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:07:45,296 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:07:45,296 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:07:45,296 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:07:45,296 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:07:45,296 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:07:45,296 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:07:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-20 22:07:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 22:07:45,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:45,300 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-20 22:07:45,300 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1653990869, now seen corresponding path program 1 times [2018-01-20 22:07:45,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:45,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:45,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:45,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:45,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:45,431 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-20 22:07:45,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:45,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:07:45,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:07:45,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:07:45,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:07:45,447 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 2 states. [2018-01-20 22:07:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:45,469 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2018-01-20 22:07:45,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:07:45,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-20 22:07:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:45,479 INFO L225 Difference]: With dead ends: 114 [2018-01-20 22:07:45,479 INFO L226 Difference]: Without dead ends: 60 [2018-01-20 22:07:45,481 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-20 22:07:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-20 22:07:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-20 22:07:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-20 22:07:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-20 22:07:45,513 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 25 [2018-01-20 22:07:45,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:45,514 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-20 22:07:45,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:07:45,514 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-20 22:07:45,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 22:07:45,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:45,516 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-20 22:07:45,516 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:45,516 INFO L82 PathProgramCache]: Analyzing trace with hash -504410673, now seen corresponding path program 1 times [2018-01-20 22:07:45,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:45,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:45,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:45,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:45,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:45,653 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-20 22:07:45,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:45,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:07:45,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:07:45,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:07:45,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:07:45,656 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 3 states. [2018-01-20 22:07:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:45,689 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-20 22:07:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:07:45,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-01-20 22:07:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:45,691 INFO L225 Difference]: With dead ends: 92 [2018-01-20 22:07:45,691 INFO L226 Difference]: Without dead ends: 76 [2018-01-20 22:07:45,692 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-20 22:07:45,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-20 22:07:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2018-01-20 22:07:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-20 22:07:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-01-20 22:07:45,698 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 37 [2018-01-20 22:07:45,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:45,698 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-01-20 22:07:45,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:07:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-01-20 22:07:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 22:07:45,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:45,699 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-20 22:07:45,700 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1373568971, now seen corresponding path program 1 times [2018-01-20 22:07:45,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:45,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:45,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:45,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:45,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:45,814 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-20 22:07:45,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:45,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 22:07:45,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:07:45,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:07:45,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:45,816 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 6 states. [2018-01-20 22:07:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:46,083 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-01-20 22:07:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 22:07:46,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-20 22:07:46,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:46,104 INFO L225 Difference]: With dead ends: 169 [2018-01-20 22:07:46,105 INFO L226 Difference]: Without dead ends: 145 [2018-01-20 22:07:46,105 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-20 22:07:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-20 22:07:46,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 79. [2018-01-20 22:07:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-20 22:07:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-01-20 22:07:46,115 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 42 [2018-01-20 22:07:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:46,116 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-01-20 22:07:46,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:07:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-01-20 22:07:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-20 22:07:46,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:46,118 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-20 22:07:46,118 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1638677120, now seen corresponding path program 1 times [2018-01-20 22:07:46,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:46,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:46,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:46,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:46,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:46,194 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-20 22:07:46,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:07:46,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-20 22:07:46,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:07:46,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:07:46,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:46,195 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 6 states. [2018-01-20 22:07:46,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:46,335 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-01-20 22:07:46,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:07:46,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-01-20 22:07:46,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:46,338 INFO L225 Difference]: With dead ends: 134 [2018-01-20 22:07:46,338 INFO L226 Difference]: Without dead ends: 103 [2018-01-20 22:07:46,339 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-20 22:07:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-20 22:07:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-01-20 22:07:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-20 22:07:46,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-01-20 22:07:46,348 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 42 [2018-01-20 22:07:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:46,348 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-01-20 22:07:46,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:07:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-01-20 22:07:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-20 22:07:46,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:46,350 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-20 22:07:46,350 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:46,350 INFO L82 PathProgramCache]: Analyzing trace with hash -322223851, now seen corresponding path program 1 times [2018-01-20 22:07:46,351 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:46,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:46,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,352 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:46,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:46,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:46,442 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-20 22:07:46,443 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:46,443 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-20 22:07:46,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:46,506 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:46,547 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-20 22:07:46,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:46,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-01-20 22:07:46,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:07:46,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:07:46,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:46,582 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 6 states. [2018-01-20 22:07:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:46,619 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-01-20 22:07:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:46,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-01-20 22:07:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:46,621 INFO L225 Difference]: With dead ends: 108 [2018-01-20 22:07:46,621 INFO L226 Difference]: Without dead ends: 92 [2018-01-20 22:07:46,621 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-20 22:07:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-20 22:07:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2018-01-20 22:07:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-20 22:07:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-01-20 22:07:46,627 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 53 [2018-01-20 22:07:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:46,628 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-01-20 22:07:46,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:07:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-01-20 22:07:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-20 22:07:46,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:46,630 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-20 22:07:46,630 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -587332000, now seen corresponding path program 1 times [2018-01-20 22:07:46,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:46,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:46,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:46,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:46,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:46,712 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-20 22:07:46,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:46,712 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-20 22:07:46,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:46,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:46,809 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-20 22:07:46,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:46,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-01-20 22:07:46,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-20 22:07:46,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-20 22:07:46,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-20 22:07:46,830 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 6 states. [2018-01-20 22:07:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:46,889 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2018-01-20 22:07:46,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:07:46,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-01-20 22:07:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:46,892 INFO L225 Difference]: With dead ends: 120 [2018-01-20 22:07:46,892 INFO L226 Difference]: Without dead ends: 104 [2018-01-20 22:07:46,893 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-20 22:07:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-20 22:07:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-01-20 22:07:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-20 22:07:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-01-20 22:07:46,908 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 53 [2018-01-20 22:07:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:46,909 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-01-20 22:07:46,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-20 22:07:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-01-20 22:07:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:07:46,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:46,911 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-20 22:07:46,911 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1429743791, now seen corresponding path program 2 times [2018-01-20 22:07:46,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:46,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:46,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:46,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:46,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:47,433 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-20 22:07:47,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:47,434 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-20 22:07:47,445 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:07:47,465 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:47,486 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:47,488 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:47,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:47,584 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-20 22:07:47,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:47,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-01-20 22:07:47,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-20 22:07:47,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-20 22:07:47,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-01-20 22:07:47,619 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 16 states. [2018-01-20 22:07:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:48,758 INFO L93 Difference]: Finished difference Result 257 states and 290 transitions. [2018-01-20 22:07:48,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-20 22:07:48,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-01-20 22:07:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:48,760 INFO L225 Difference]: With dead ends: 257 [2018-01-20 22:07:48,760 INFO L226 Difference]: Without dead ends: 233 [2018-01-20 22:07:48,762 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-20 22:07:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-20 22:07:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 150. [2018-01-20 22:07:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-20 22:07:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-01-20 22:07:48,776 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 58 [2018-01-20 22:07:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:48,777 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-01-20 22:07:48,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-20 22:07:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-01-20 22:07:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-20 22:07:48,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:48,778 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-20 22:07:48,778 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1712979939, now seen corresponding path program 1 times [2018-01-20 22:07:48,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:48,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:48,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:48,779 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:48,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:48,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:48,857 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-20 22:07:48,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:48,857 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-20 22:07:48,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:48,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:49,076 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-20 22:07:49,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:49,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-01-20 22:07:49,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 22:07:49,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 22:07:49,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:07:49,100 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 8 states. [2018-01-20 22:07:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:49,255 INFO L93 Difference]: Finished difference Result 244 states and 277 transitions. [2018-01-20 22:07:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:07:49,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-20 22:07:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:49,258 INFO L225 Difference]: With dead ends: 244 [2018-01-20 22:07:49,258 INFO L226 Difference]: Without dead ends: 218 [2018-01-20 22:07:49,258 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:07:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-20 22:07:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2018-01-20 22:07:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-20 22:07:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-01-20 22:07:49,270 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 65 [2018-01-20 22:07:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:49,270 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-01-20 22:07:49,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 22:07:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-01-20 22:07:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-20 22:07:49,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:49,271 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-20 22:07:49,271 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1486889906, now seen corresponding path program 1 times [2018-01-20 22:07:49,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:49,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:49,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:49,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:49,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:49,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:49,399 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-20 22:07:49,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:49,400 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-20 22:07:49,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:49,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:49,527 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-20 22:07:49,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:49,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-01-20 22:07:49,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 22:07:49,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 22:07:49,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:07:49,548 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 10 states. [2018-01-20 22:07:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:49,623 INFO L93 Difference]: Finished difference Result 240 states and 269 transitions. [2018-01-20 22:07:49,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:07:49,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-01-20 22:07:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:49,625 INFO L225 Difference]: With dead ends: 240 [2018-01-20 22:07:49,626 INFO L226 Difference]: Without dead ends: 218 [2018-01-20 22:07:49,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:07:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-20 22:07:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 170. [2018-01-20 22:07:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-01-20 22:07:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2018-01-20 22:07:49,639 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 70 [2018-01-20 22:07:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:49,639 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-01-20 22:07:49,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 22:07:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2018-01-20 22:07:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-20 22:07:49,640 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:49,640 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-20 22:07:49,640 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:49,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1819098567, now seen corresponding path program 2 times [2018-01-20 22:07:49,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:49,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:49,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:49,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:49,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:49,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:49,892 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-20 22:07:49,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:49,893 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-20 22:07:49,898 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:07:49,914 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:49,925 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:49,927 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:49,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:49,996 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-20 22:07:50,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:50,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2018-01-20 22:07:50,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-20 22:07:50,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-20 22:07:50,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-01-20 22:07:50,018 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 20 states. [2018-01-20 22:07:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:51,024 INFO L93 Difference]: Finished difference Result 339 states and 376 transitions. [2018-01-20 22:07:51,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-20 22:07:51,024 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-01-20 22:07:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:51,025 INFO L225 Difference]: With dead ends: 339 [2018-01-20 22:07:51,025 INFO L226 Difference]: Without dead ends: 287 [2018-01-20 22:07:51,026 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=551, Invalid=2311, Unknown=0, NotChecked=0, Total=2862 [2018-01-20 22:07:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-20 22:07:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2018-01-20 22:07:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-20 22:07:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 202 transitions. [2018-01-20 22:07:51,038 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 202 transitions. Word has length 70 [2018-01-20 22:07:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:51,039 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 202 transitions. [2018-01-20 22:07:51,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-20 22:07:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 202 transitions. [2018-01-20 22:07:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-20 22:07:51,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:51,040 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-20 22:07:51,040 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 551714658, now seen corresponding path program 1 times [2018-01-20 22:07:51,041 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:51,041 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:51,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,042 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:51,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:51,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:51,126 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-20 22:07:51,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:51,160 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-20 22:07:51,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:51,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:51,242 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-20 22:07:51,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:51,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-01-20 22:07:51,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 22:07:51,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 22:07:51,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=48, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:07:51,264 INFO L87 Difference]: Start difference. First operand 179 states and 202 transitions. Second operand 10 states. [2018-01-20 22:07:51,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:51,306 INFO L93 Difference]: Finished difference Result 300 states and 339 transitions. [2018-01-20 22:07:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 22:07:51,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-01-20 22:07:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:51,308 INFO L225 Difference]: With dead ends: 300 [2018-01-20 22:07:51,309 INFO L226 Difference]: Without dead ends: 274 [2018-01-20 22:07:51,309 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-20 22:07:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-20 22:07:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 189. [2018-01-20 22:07:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-20 22:07:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 214 transitions. [2018-01-20 22:07:51,322 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 214 transitions. Word has length 70 [2018-01-20 22:07:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:51,322 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 214 transitions. [2018-01-20 22:07:51,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 22:07:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 214 transitions. [2018-01-20 22:07:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-20 22:07:51,323 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:51,323 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-20 22:07:51,323 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash 947921752, now seen corresponding path program 2 times [2018-01-20 22:07:51,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:51,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:51,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:51,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:51,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:51,401 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-20 22:07:51,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:51,402 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-20 22:07:51,408 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:07:51,420 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:51,429 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:51,431 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:51,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:51,481 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-20 22:07:51,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:51,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-20 22:07:51,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 22:07:51,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 22:07:51,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:07:51,503 INFO L87 Difference]: Start difference. First operand 189 states and 214 transitions. Second operand 12 states. [2018-01-20 22:07:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:51,552 INFO L93 Difference]: Finished difference Result 286 states and 319 transitions. [2018-01-20 22:07:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 22:07:51,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-01-20 22:07:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:51,554 INFO L225 Difference]: With dead ends: 286 [2018-01-20 22:07:51,554 INFO L226 Difference]: Without dead ends: 264 [2018-01-20 22:07:51,555 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-20 22:07:51,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-20 22:07:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 199. [2018-01-20 22:07:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-20 22:07:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 224 transitions. [2018-01-20 22:07:51,568 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 224 transitions. Word has length 75 [2018-01-20 22:07:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:51,569 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 224 transitions. [2018-01-20 22:07:51,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 22:07:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 224 transitions. [2018-01-20 22:07:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-20 22:07:51,570 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:51,570 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-20 22:07:51,570 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1425638509, now seen corresponding path program 2 times [2018-01-20 22:07:51,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:51,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:51,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,572 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:51,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:51,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:51,648 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-20 22:07:51,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:51,648 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-20 22:07:51,653 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:07:51,669 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:51,680 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:51,682 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:51,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:51,743 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-20 22:07:51,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:51,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-20 22:07:51,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-20 22:07:51,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-20 22:07:51,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=70, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:07:51,764 INFO L87 Difference]: Start difference. First operand 199 states and 224 transitions. Second operand 12 states. [2018-01-20 22:07:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:51,898 INFO L93 Difference]: Finished difference Result 401 states and 450 transitions. [2018-01-20 22:07:51,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 22:07:51,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-01-20 22:07:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:51,901 INFO L225 Difference]: With dead ends: 401 [2018-01-20 22:07:51,901 INFO L226 Difference]: Without dead ends: 375 [2018-01-20 22:07:51,901 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-20 22:07:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-20 22:07:51,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 209. [2018-01-20 22:07:51,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-20 22:07:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 236 transitions. [2018-01-20 22:07:51,915 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 236 transitions. Word has length 75 [2018-01-20 22:07:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:51,915 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 236 transitions. [2018-01-20 22:07:51,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-20 22:07:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 236 transitions. [2018-01-20 22:07:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-20 22:07:51,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:51,917 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-20 22:07:51,917 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:51,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1425278094, now seen corresponding path program 3 times [2018-01-20 22:07:51,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:51,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:51,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,918 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:51,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:51,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:52,008 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-20 22:07:52,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:52,009 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-20 22:07:52,014 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:07:52,029 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,035 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,042 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,046 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,051 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,055 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,056 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:52,058 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:52,117 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-20 22:07:52,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:52,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-01-20 22:07:52,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-20 22:07:52,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-20 22:07:52,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:07:52,139 INFO L87 Difference]: Start difference. First operand 209 states and 236 transitions. Second operand 14 states. [2018-01-20 22:07:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:52,206 INFO L93 Difference]: Finished difference Result 329 states and 366 transitions. [2018-01-20 22:07:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 22:07:52,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-01-20 22:07:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:52,208 INFO L225 Difference]: With dead ends: 329 [2018-01-20 22:07:52,208 INFO L226 Difference]: Without dead ends: 307 [2018-01-20 22:07:52,208 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-01-20 22:07:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-20 22:07:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 219. [2018-01-20 22:07:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-20 22:07:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 246 transitions. [2018-01-20 22:07:52,222 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 246 transitions. Word has length 80 [2018-01-20 22:07:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:52,222 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 246 transitions. [2018-01-20 22:07:52,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-20 22:07:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 246 transitions. [2018-01-20 22:07:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-20 22:07:52,230 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:52,230 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-20 22:07:52,230 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1802145815, now seen corresponding path program 3 times [2018-01-20 22:07:52,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:52,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:52,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:52,232 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:52,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:52,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:52,325 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-20 22:07:52,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:52,325 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-20 22:07:52,332 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:07:52,347 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,356 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,363 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,369 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:07:52,370 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:52,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:52,398 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-20 22:07:52,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:07:52,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:07:52,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:07:52,457 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-20 22:07:52,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-20 22:07:52,504 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-20 22:07:52,508 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-20 22:07:52,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,547 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-20 22:07:52,550 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-20 22:07:52,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,559 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-20 22:07:52,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-01-20 22:07:52,642 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-20 22:07:52,645 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-20 22:07:52,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,673 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-20 22:07:52,678 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-20 22:07:52,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,698 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-20 22:07:52,700 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-20 22:07:52,700 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,704 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,723 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:142, output treesize:42 [2018-01-20 22:07:52,762 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 31 treesize of output 25 [2018-01-20 22:07:52,764 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 25 treesize of output 16 [2018-01-20 22:07:52,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,776 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 26 treesize of output 20 [2018-01-20 22:07:52,778 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 20 treesize of output 11 [2018-01-20 22:07:52,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,796 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-20 22:07:52,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:11 [2018-01-20 22:07:52,834 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 15 treesize of output 11 [2018-01-20 22:07:52,840 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-20 22:07:52,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:52,842 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-20 22:07:52,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-20 22:07:52,866 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-20 22:07:52,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:52,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2018-01-20 22:07:52,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 22:07:52,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 22:07:52,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:07:52,888 INFO L87 Difference]: Start difference. First operand 219 states and 246 transitions. Second operand 21 states. [2018-01-20 22:07:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:54,463 INFO L93 Difference]: Finished difference Result 474 states and 525 transitions. [2018-01-20 22:07:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-20 22:07:54,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-01-20 22:07:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:54,465 INFO L225 Difference]: With dead ends: 474 [2018-01-20 22:07:54,465 INFO L226 Difference]: Without dead ends: 427 [2018-01-20 22:07:54,466 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=614, Invalid=2248, Unknown=0, NotChecked=0, Total=2862 [2018-01-20 22:07:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-01-20 22:07:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 229. [2018-01-20 22:07:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-20 22:07:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 257 transitions. [2018-01-20 22:07:54,479 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 257 transitions. Word has length 80 [2018-01-20 22:07:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:54,479 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 257 transitions. [2018-01-20 22:07:54,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 22:07:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 257 transitions. [2018-01-20 22:07:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-20 22:07:54,480 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:54,480 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-20 22:07:54,480 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash -628808808, now seen corresponding path program 4 times [2018-01-20 22:07:54,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:54,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:54,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:54,481 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:54,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:54,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:54,619 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-20 22:07:54,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:54,620 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-20 22:07:54,628 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:07:54,674 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:54,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:54,689 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-20 22:07:54,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:07:54,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:07:54,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:07:54,752 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-20 22:07:54,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-20 22:07:54,830 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-20 22:07:54,832 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-20 22:07:54,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,850 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-20 22:07:54,856 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-20 22:07:54,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:54,882 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-20 22:07:54,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:17 [2018-01-20 22:07:55,019 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-20 22:07:55,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-20 22:07:55,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,053 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-20 22:07:55,056 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-20 22:07:55,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,085 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-20 22:07:55,089 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-20 22:07:55,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,094 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,099 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-01-20 22:07:55,175 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-20 22:07:55,178 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-20 22:07:55,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,191 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-20 22:07:55,194 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-20 22:07:55,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,206 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-20 22:07:55,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2018-01-20 22:07:55,295 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-20 22:07:55,300 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-20 22:07:55,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:55,307 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-20 22:07:55,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-20 22:07:55,358 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-20 22:07:55,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:55,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2018-01-20 22:07:55,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-20 22:07:55,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-20 22:07:55,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:07:55,381 INFO L87 Difference]: Start difference. First operand 229 states and 257 transitions. Second operand 22 states. [2018-01-20 22:07:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:56,165 INFO L93 Difference]: Finished difference Result 409 states and 451 transitions. [2018-01-20 22:07:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-20 22:07:56,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-01-20 22:07:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:56,167 INFO L225 Difference]: With dead ends: 409 [2018-01-20 22:07:56,167 INFO L226 Difference]: Without dead ends: 347 [2018-01-20 22:07:56,168 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=480, Invalid=1590, Unknown=0, NotChecked=0, Total=2070 [2018-01-20 22:07:56,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-01-20 22:07:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 234. [2018-01-20 22:07:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-01-20 22:07:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 261 transitions. [2018-01-20 22:07:56,176 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 261 transitions. Word has length 85 [2018-01-20 22:07:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:56,177 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 261 transitions. [2018-01-20 22:07:56,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-20 22:07:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 261 transitions. [2018-01-20 22:07:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-20 22:07:56,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:56,177 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-20 22:07:56,178 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 875164136, now seen corresponding path program 4 times [2018-01-20 22:07:56,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:56,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:56,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:56,178 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:56,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:56,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:56,306 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-20 22:07:56,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:56,307 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-20 22:07:56,314 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:07:56,351 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:56,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:56,359 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-20 22:07:56,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:07:56,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:07:56,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:07:56,391 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-20 22:07:56,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-20 22:07:56,432 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-20 22:07:56,434 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-20 22:07:56,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,444 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-20 22:07:56,446 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-20 22:07:56,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,453 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-20 22:07:56,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:17 [2018-01-20 22:07:56,517 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-20 22:07:56,524 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-20 22:07:56,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,537 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-20 22:07:56,540 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-20 22:07:56,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,551 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-20 22:07:56,568 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-20 22:07:56,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,585 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,613 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2018-01-20 22:07:56,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-20 22:07:56,680 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-20 22:07:56,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,688 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-20 22:07:56,690 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-20 22:07:56,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,694 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-20 22:07:56,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2018-01-20 22:07:56,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-20 22:07:56,727 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-20 22:07:56,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:07:56,731 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-20 22:07:56,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-20 22:07:56,752 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-20 22:07:56,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:56,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2018-01-20 22:07:56,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-20 22:07:56,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-20 22:07:56,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:07:56,774 INFO L87 Difference]: Start difference. First operand 234 states and 261 transitions. Second operand 22 states. [2018-01-20 22:07:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:57,910 INFO L93 Difference]: Finished difference Result 472 states and 524 transitions. [2018-01-20 22:07:57,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-20 22:07:57,911 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-01-20 22:07:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:57,912 INFO L225 Difference]: With dead ends: 472 [2018-01-20 22:07:57,912 INFO L226 Difference]: Without dead ends: 397 [2018-01-20 22:07:57,914 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-20 22:07:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-20 22:07:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 209. [2018-01-20 22:07:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-20 22:07:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2018-01-20 22:07:57,926 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 85 [2018-01-20 22:07:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:57,926 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2018-01-20 22:07:57,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-20 22:07:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2018-01-20 22:07:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-20 22:07:57,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:57,928 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-20 22:07:57,928 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1256975908, now seen corresponding path program 1 times [2018-01-20 22:07:57,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:57,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:57,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:57,929 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:57,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:57,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:58,078 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-20 22:07:58,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:58,079 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-20 22:07:58,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:58,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:58,212 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-20 22:07:58,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:58,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-20 22:07:58,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-20 22:07:58,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-20 22:07:58,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=131, Unknown=0, NotChecked=0, Total=240 [2018-01-20 22:07:58,247 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand 16 states. [2018-01-20 22:07:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:58,369 INFO L93 Difference]: Finished difference Result 454 states and 507 transitions. [2018-01-20 22:07:58,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-20 22:07:58,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2018-01-20 22:07:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:58,372 INFO L225 Difference]: With dead ends: 454 [2018-01-20 22:07:58,372 INFO L226 Difference]: Without dead ends: 438 [2018-01-20 22:07:58,372 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-20 22:07:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-01-20 22:07:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 209. [2018-01-20 22:07:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-20 22:07:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2018-01-20 22:07:58,383 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 89 [2018-01-20 22:07:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:58,384 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2018-01-20 22:07:58,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-20 22:07:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2018-01-20 22:07:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-20 22:07:58,385 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:58,385 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-20 22:07:58,385 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash -969822206, now seen corresponding path program 1 times [2018-01-20 22:07:58,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:58,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:58,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:58,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:58,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:58,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:58,640 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-20 22:07:58,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:58,640 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-20 22:07:58,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:58,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:58,800 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-20 22:07:58,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:58,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-01-20 22:07:58,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-20 22:07:58,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-20 22:07:58,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:07:58,833 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand 22 states. [2018-01-20 22:07:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:59,521 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2018-01-20 22:07:59,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 22:07:59,522 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2018-01-20 22:07:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:59,522 INFO L225 Difference]: With dead ends: 353 [2018-01-20 22:07:59,523 INFO L226 Difference]: Without dead ends: 288 [2018-01-20 22:07:59,523 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=1564, Unknown=0, NotChecked=0, Total=1980 [2018-01-20 22:07:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-20 22:07:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 161. [2018-01-20 22:07:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-20 22:07:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2018-01-20 22:07:59,532 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 90 [2018-01-20 22:07:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:59,532 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2018-01-20 22:07:59,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-20 22:07:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2018-01-20 22:07:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-20 22:07:59,533 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:59,533 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-20 22:07:59,533 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash 454315264, now seen corresponding path program 2 times [2018-01-20 22:07:59,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:59,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:59,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:59,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:07:59,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:59,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:07:59,669 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-20 22:07:59,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:07:59,669 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-20 22:07:59,676 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:07:59,697 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:59,717 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:07:59,720 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:07:59,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:07:59,814 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-20 22:07:59,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:07:59,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-20 22:07:59,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-20 22:07:59,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-20 22:07:59,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2018-01-20 22:07:59,836 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand 18 states. [2018-01-20 22:07:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:07:59,949 INFO L93 Difference]: Finished difference Result 464 states and 523 transitions. [2018-01-20 22:07:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-20 22:07:59,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-01-20 22:07:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:07:59,952 INFO L225 Difference]: With dead ends: 464 [2018-01-20 22:07:59,952 INFO L226 Difference]: Without dead ends: 446 [2018-01-20 22:07:59,953 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-20 22:07:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-01-20 22:07:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 166. [2018-01-20 22:07:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-01-20 22:07:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 186 transitions. [2018-01-20 22:07:59,963 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 186 transitions. Word has length 94 [2018-01-20 22:07:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:07:59,963 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 186 transitions. [2018-01-20 22:07:59,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-20 22:07:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 186 transitions. [2018-01-20 22:07:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-20 22:07:59,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:07:59,964 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-20 22:07:59,965 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:07:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash 996948175, now seen corresponding path program 3 times [2018-01-20 22:07:59,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:07:59,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:07:59,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:59,966 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:07:59,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:07:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:07:59,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:00,787 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-20 22:08:00,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:00,787 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-20 22:08:00,792 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:08:00,808 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:00,814 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:00,821 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:00,823 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:00,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:01,053 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-20 22:08:01,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:08:01,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:01,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:01,065 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-20 22:08:01,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:40 [2018-01-20 22:08:01,124 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-20 22:08:01,126 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-20 22:08:01,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:01,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:01,133 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-20 22:08:01,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2018-01-20 22:08:01,359 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-20 22:08:01,413 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-20 22:08:01,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:01,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 32 [2018-01-20 22:08:01,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-20 22:08:01,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-20 22:08:01,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=802, Unknown=31, NotChecked=58, Total=992 [2018-01-20 22:08:01,447 INFO L87 Difference]: Start difference. First operand 166 states and 186 transitions. Second operand 32 states. [2018-01-20 22:08:01,775 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 44 DAG size of output 33 [2018-01-20 22:08:02,092 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 103 DAG size of output 79 [2018-01-20 22:08:02,278 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 95 DAG size of output 71 [2018-01-20 22:08:02,741 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 112 DAG size of output 90 [2018-01-20 22:08:03,154 WARN L146 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 114 DAG size of output 90 [2018-01-20 22:08:03,343 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 75 DAG size of output 65 [2018-01-20 22:08:03,684 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 92 DAG size of output 77 [2018-01-20 22:08:03,838 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 84 DAG size of output 69 [2018-01-20 22:08:04,402 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 101 DAG size of output 80 [2018-01-20 22:08:04,648 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 107 DAG size of output 81 [2018-01-20 22:08:04,997 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 115 DAG size of output 80 [2018-01-20 22:08:05,267 WARN L146 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 121 DAG size of output 82 [2018-01-20 22:08:05,692 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-01-20 22:08:06,369 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 84 DAG size of output 63 [2018-01-20 22:08:07,011 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 98 DAG size of output 67 [2018-01-20 22:08:07,413 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 83 DAG size of output 63 [2018-01-20 22:08:07,699 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-01-20 22:08:07,882 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 74 DAG size of output 62 [2018-01-20 22:08:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:09,759 INFO L93 Difference]: Finished difference Result 640 states and 717 transitions. [2018-01-20 22:08:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-20 22:08:09,760 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 99 [2018-01-20 22:08:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:09,761 INFO L225 Difference]: With dead ends: 640 [2018-01-20 22:08:09,761 INFO L226 Difference]: Without dead ends: 629 [2018-01-20 22:08:09,763 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=5500, Unknown=81, NotChecked=160, Total=6806 [2018-01-20 22:08:09,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-01-20 22:08:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 304. [2018-01-20 22:08:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-01-20 22:08:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 342 transitions. [2018-01-20 22:08:09,788 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 342 transitions. Word has length 99 [2018-01-20 22:08:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:09,788 INFO L432 AbstractCegarLoop]: Abstraction has 304 states and 342 transitions. [2018-01-20 22:08:09,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-20 22:08:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 342 transitions. [2018-01-20 22:08:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-20 22:08:09,790 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:09,790 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-20 22:08:09,790 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 46358264, now seen corresponding path program 5 times [2018-01-20 22:08:09,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:09,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:09,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:09,791 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:08:09,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:09,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:10,009 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-20 22:08:10,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:10,010 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-20 22:08:10,018 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 22:08:10,032 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,035 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,037 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,039 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,042 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,045 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,051 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,062 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,094 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:10,097 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:10,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:10,322 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-20 22:08:10,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:10,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-20 22:08:10,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-20 22:08:10,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-20 22:08:10,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-01-20 22:08:10,357 INFO L87 Difference]: Start difference. First operand 304 states and 342 transitions. Second operand 20 states. [2018-01-20 22:08:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:10,493 INFO L93 Difference]: Finished difference Result 497 states and 552 transitions. [2018-01-20 22:08:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-20 22:08:10,493 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2018-01-20 22:08:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:10,495 INFO L225 Difference]: With dead ends: 497 [2018-01-20 22:08:10,495 INFO L226 Difference]: Without dead ends: 475 [2018-01-20 22:08:10,496 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-01-20 22:08:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-01-20 22:08:10,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 314. [2018-01-20 22:08:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-20 22:08:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 352 transitions. [2018-01-20 22:08:10,524 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 352 transitions. Word has length 106 [2018-01-20 22:08:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:10,524 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 352 transitions. [2018-01-20 22:08:10,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-20 22:08:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 352 transitions. [2018-01-20 22:08:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-20 22:08:10,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:10,526 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-20 22:08:10,526 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 417027715, now seen corresponding path program 3 times [2018-01-20 22:08:10,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:10,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:10,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:10,528 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:08:10,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:10,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:10,716 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-20 22:08:10,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:10,716 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-20 22:08:10,721 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:08:10,745 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:10,766 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:10,782 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:10,787 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:10,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:10,795 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-20 22:08:10,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:08:10,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 11 treesize of output 8 [2018-01-20 22:08:10,856 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-20 22:08:10,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-20 22:08:10,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:10,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:10,891 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-20 22:08:10,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-20 22:08:10,946 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-20 22:08:10,949 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-20 22:08:10,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:10,979 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-20 22:08:10,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:10,984 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-20 22:08:10,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,028 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-20 22:08:11,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-20 22:08:11,050 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-20 22:08:11,052 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-20 22:08:11,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-20 22:08:11,086 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-20 22:08:11,088 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-20 22:08:11,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-20 22:08:11,155 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-20 22:08:11,157 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-20 22:08:11,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,169 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-20 22:08:11,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:11,173 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-20 22:08:11,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:31 [2018-01-20 22:08:11,206 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-20 22:08:11,208 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-20 22:08:11,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,216 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-20 22:08:11,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-01-20 22:08:11,274 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:11,299 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-20 22:08:11,304 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-20 22:08:11,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,371 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-20 22:08:11,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,404 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:11,409 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-20 22:08:11,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:08:11,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:11,436 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-20 22:08:11,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:08:11,469 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-20 22:08:11,469 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-01-20 22:08:11,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:11,563 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-20 22:08:11,570 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-20 22:08:11,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,575 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-20 22:08:11,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,586 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-20 22:08:11,587 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-20 22:08:11,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,591 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-20 22:08:11,591 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,593 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:11,598 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-20 22:08:11,598 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:53, output treesize:7 [2018-01-20 22:08:11,630 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-20 22:08:11,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:11,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 20] total 29 [2018-01-20 22:08:11,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-20 22:08:11,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-20 22:08:11,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-01-20 22:08:11,652 INFO L87 Difference]: Start difference. First operand 314 states and 352 transitions. Second operand 29 states. [2018-01-20 22:08:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:13,573 INFO L93 Difference]: Finished difference Result 733 states and 813 transitions. [2018-01-20 22:08:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-20 22:08:13,573 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 106 [2018-01-20 22:08:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:13,575 INFO L225 Difference]: With dead ends: 733 [2018-01-20 22:08:13,575 INFO L226 Difference]: Without dead ends: 631 [2018-01-20 22:08:13,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=919, Invalid=4051, Unknown=0, NotChecked=0, Total=4970 [2018-01-20 22:08:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2018-01-20 22:08:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 344. [2018-01-20 22:08:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-20 22:08:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 387 transitions. [2018-01-20 22:08:13,598 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 387 transitions. Word has length 106 [2018-01-20 22:08:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:13,598 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 387 transitions. [2018-01-20 22:08:13,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-20 22:08:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 387 transitions. [2018-01-20 22:08:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-20 22:08:13,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:13,600 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-20 22:08:13,600 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1851980846, now seen corresponding path program 6 times [2018-01-20 22:08:13,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:13,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:13,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:13,601 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:08:13,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:13,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:13,826 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-20 22:08:13,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:13,826 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-20 22:08:13,834 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 22:08:13,858 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:13,864 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:13,873 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:13,883 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:13,899 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:13,907 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:13,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:14,094 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-20 22:08:14,096 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-20 22:08:14,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,110 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-20 22:08:14,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:43 [2018-01-20 22:08:14,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:14,241 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-20 22:08:14,243 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-20 22:08:14,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:46 [2018-01-20 22:08:14,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:14,343 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-20 22:08:14,346 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-20 22:08:14,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,378 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-20 22:08:14,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:78 [2018-01-20 22:08:14,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:14,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:14,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:14,594 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-20 22:08:14,605 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-20 22:08:14,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,637 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-20 22:08:14,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:81 [2018-01-20 22:08:14,867 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:14,869 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-20 22:08:14,872 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 57 treesize of output 44 [2018-01-20 22:08:14,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:14,883 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-20 22:08:14,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:08:14,891 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-20 22:08:14,900 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-20 22:08:14,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:36 [2018-01-20 22:08:15,035 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_49 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)) (= (select .cse1 v_arrayElimCell_49) 0) (not (= 0 main_~p~7.base)) (= |c_#valid| (store (store .cse1 v_arrayElimCell_49 1) main_~p~7.base 0)))))) is different from true [2018-01-20 22:08:15,040 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_49 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 (not (= 0 v_subst_2)) (= 0 (select .cse0 v_arrayElimCell_49)) (= 0 (select .cse1 c_main_~p~7.base)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_49 1) v_subst_2 0)))))) is different from true [2018-01-20 22:08:15,055 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimCell_49 Int) (v_subst_2 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_2 1))) (let ((.cse0 (store .cse1 0 1))) (and (= |c_#valid| (store (store .cse0 v_arrayElimCell_49 1) v_subst_2 0)) (not (= 0 v_subst_2)) (= (select .cse0 v_arrayElimCell_49) 0) (= 0 (select .cse1 0)))))) (exists ((v_prenex_15 Int) (v_prenex_14 Int) (main_~p~7.base Int)) (let ((.cse3 (store |c_old(#valid)| v_prenex_15 1))) (let ((.cse2 (store .cse3 main_~p~7.base 1))) (and (not (= 0 v_prenex_15)) (= 0 (select .cse2 v_prenex_14)) (= 0 (select .cse3 main_~p~7.base)) (not (= 0 main_~p~7.base)) (= (store (store (store .cse2 v_prenex_14 1) v_prenex_15 0) main_~p~7.base 0) |c_#valid|))))) (exists ((v_prenex_16 Int) (v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse4 (store |c_old(#valid)| v_prenex_18 1))) (let ((.cse5 (store .cse4 v_prenex_17 1))) (and (= 0 (select |c_#valid| v_prenex_17)) (= 0 (select .cse4 v_prenex_17)) (= 0 (select .cse5 v_prenex_16)) (= |c_#valid| (store (store .cse5 v_prenex_16 1) v_prenex_18 0)) (not (= 0 v_prenex_18))))))) is different from true [2018-01-20 22:08:15,179 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-20 22:08:15,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:15,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24] total 35 [2018-01-20 22:08:15,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-20 22:08:15,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-20 22:08:15,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=884, Unknown=3, NotChecked=186, Total=1190 [2018-01-20 22:08:15,213 INFO L87 Difference]: Start difference. First operand 344 states and 387 transitions. Second operand 35 states. [2018-01-20 22:08:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:18,271 INFO L93 Difference]: Finished difference Result 614 states and 676 transitions. [2018-01-20 22:08:18,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-20 22:08:18,271 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 111 [2018-01-20 22:08:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:18,272 INFO L225 Difference]: With dead ends: 614 [2018-01-20 22:08:18,272 INFO L226 Difference]: Without dead ends: 587 [2018-01-20 22:08:18,274 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=979, Invalid=5133, Unknown=62, NotChecked=468, Total=6642 [2018-01-20 22:08:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-01-20 22:08:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 417. [2018-01-20 22:08:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-01-20 22:08:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 461 transitions. [2018-01-20 22:08:18,308 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 461 transitions. Word has length 111 [2018-01-20 22:08:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:18,308 INFO L432 AbstractCegarLoop]: Abstraction has 417 states and 461 transitions. [2018-01-20 22:08:18,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-20 22:08:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 461 transitions. [2018-01-20 22:08:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-20 22:08:18,310 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:18,310 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-20 22:08:18,310 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1032085417, now seen corresponding path program 1 times [2018-01-20 22:08:18,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:18,311 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:18,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:18,311 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:08:18,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:18,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:18,516 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-20 22:08:18,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:18,516 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-20 22:08:18,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:18,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:18,712 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-20 22:08:18,733 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:18,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-01-20 22:08:18,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-20 22:08:18,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-20 22:08:18,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=260, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:08:18,734 INFO L87 Difference]: Start difference. First operand 417 states and 461 transitions. Second operand 22 states. [2018-01-20 22:08:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:18,877 INFO L93 Difference]: Finished difference Result 871 states and 963 transitions. [2018-01-20 22:08:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-20 22:08:18,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-01-20 22:08:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:18,879 INFO L225 Difference]: With dead ends: 871 [2018-01-20 22:08:18,879 INFO L226 Difference]: Without dead ends: 845 [2018-01-20 22:08:18,880 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-20 22:08:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-01-20 22:08:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 427. [2018-01-20 22:08:18,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-01-20 22:08:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 473 transitions. [2018-01-20 22:08:18,903 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 473 transitions. Word has length 111 [2018-01-20 22:08:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:18,903 INFO L432 AbstractCegarLoop]: Abstraction has 427 states and 473 transitions. [2018-01-20 22:08:18,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-20 22:08:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 473 transitions. [2018-01-20 22:08:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-20 22:08:18,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:18,904 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-20 22:08:18,904 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1275428872, now seen corresponding path program 1 times [2018-01-20 22:08:18,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:18,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:18,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:18,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:18,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:18,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:19,331 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-20 22:08:19,331 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:19,332 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-20 22:08:19,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:19,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:19,590 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-20 22:08:19,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:19,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2018-01-20 22:08:19,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-20 22:08:19,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-20 22:08:19,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2018-01-20 22:08:19,611 INFO L87 Difference]: Start difference. First operand 427 states and 473 transitions. Second operand 34 states. [2018-01-20 22:08:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:21,779 INFO L93 Difference]: Finished difference Result 857 states and 937 transitions. [2018-01-20 22:08:21,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-20 22:08:21,780 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 116 [2018-01-20 22:08:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:21,782 INFO L225 Difference]: With dead ends: 857 [2018-01-20 22:08:21,782 INFO L226 Difference]: Without dead ends: 770 [2018-01-20 22:08:21,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2159 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1382, Invalid=7548, Unknown=0, NotChecked=0, Total=8930 [2018-01-20 22:08:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-01-20 22:08:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 447. [2018-01-20 22:08:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-01-20 22:08:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 493 transitions. [2018-01-20 22:08:21,824 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 493 transitions. Word has length 116 [2018-01-20 22:08:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:21,825 INFO L432 AbstractCegarLoop]: Abstraction has 447 states and 493 transitions. [2018-01-20 22:08:21,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-20 22:08:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 493 transitions. [2018-01-20 22:08:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-20 22:08:21,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:21,827 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-20 22:08:21,827 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1912718803, now seen corresponding path program 2 times [2018-01-20 22:08:21,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:21,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:21,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:21,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:08:21,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:21,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:22,013 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-20 22:08:22,014 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:22,014 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-20 22:08:22,019 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:08:22,036 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:22,052 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:22,056 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:22,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:22,158 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-20 22:08:22,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:22,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-01-20 22:08:22,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-20 22:08:22,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-20 22:08:22,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=313, Unknown=0, NotChecked=0, Total=552 [2018-01-20 22:08:22,180 INFO L87 Difference]: Start difference. First operand 447 states and 493 transitions. Second operand 24 states. [2018-01-20 22:08:22,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:22,341 INFO L93 Difference]: Finished difference Result 956 states and 1056 transitions. [2018-01-20 22:08:22,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-20 22:08:22,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 116 [2018-01-20 22:08:22,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:22,344 INFO L225 Difference]: With dead ends: 956 [2018-01-20 22:08:22,344 INFO L226 Difference]: Without dead ends: 930 [2018-01-20 22:08:22,345 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-20 22:08:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-01-20 22:08:22,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 457. [2018-01-20 22:08:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-01-20 22:08:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2018-01-20 22:08:22,377 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 116 [2018-01-20 22:08:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:22,377 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2018-01-20 22:08:22,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-20 22:08:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2018-01-20 22:08:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-01-20 22:08:22,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:22,379 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-20 22:08:22,379 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2099490263, now seen corresponding path program 3 times [2018-01-20 22:08:22,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:22,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:22,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:22,380 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:08:22,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:22,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:22,576 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-20 22:08:22,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:22,576 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-20 22:08:22,581 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:08:22,601 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:22,611 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:08:22,616 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:22,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:22,747 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-20 22:08:22,749 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-20 22:08:22,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:22,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:22,761 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-20 22:08:22,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:43 [2018-01-20 22:08:22,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:22,842 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-20 22:08:22,843 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-20 22:08:22,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:22,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:22,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:22,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:46 [2018-01-20 22:08:22,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:22,924 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-20 22:08:22,926 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-20 22:08:22,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:22,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:22,945 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-20 22:08:22,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:78 [2018-01-20 22:08:23,091 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:23,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:23,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:23,118 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-20 22:08:23,124 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-20 22:08:23,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,168 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-20 22:08:23,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:81 [2018-01-20 22:08:23,434 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 86 [2018-01-20 22:08:23,435 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-20 22:08:23,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:23,473 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 90 treesize of output 74 [2018-01-20 22:08:23,476 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-20 22:08:23,476 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:08:23,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-01-20 22:08:23,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:08:23,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:08:23,520 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 79 treesize of output 65 [2018-01-20 22:08:23,522 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 57 treesize of output 44 [2018-01-20 22:08:23,523 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,532 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-20 22:08:23,533 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:08:23,540 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:08:23,558 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 47 treesize of output 45 [2018-01-20 22:08:23,560 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-20 22:08:23,560 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,567 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:23,584 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-20 22:08:23,617 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:181, output treesize:81 [2018-01-20 22:08:23,747 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~t~7.offset 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.base 0)) (exists ((v_prenex_24 Int) (v_arrayElimCell_57 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_24 1))) (let ((.cse3 (store .cse2 c_main_~t~7.base 1))) (and (= 0 (select .cse2 c_main_~t~7.base)) (= (select .cse3 v_arrayElimCell_57) 0) (= |c_#valid| (store (store .cse3 v_arrayElimCell_57 1) v_prenex_24 0)) (not (= 0 v_prenex_24)))))))) is different from true [2018-01-20 22:08:23,751 WARN L1029 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_24 Int) (v_arrayElimCell_57 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_24 1))) (let ((.cse1 (store .cse0 c_main_~p~7.base 1))) (and (= (select .cse0 c_main_~p~7.base) 0) (= (store (store .cse1 v_arrayElimCell_57 1) v_prenex_24 0) |c_#valid|) (= 0 (select .cse1 v_arrayElimCell_57)) (not (= 0 v_prenex_24)))))) (not (= 0 c_main_~p~7.base))) (and (exists ((v_arrayElimCell_60 Int) (v_subst_3 Int)) (let ((.cse3 (store |c_old(#valid)| v_subst_3 1))) (let ((.cse2 (store .cse3 c_main_~p~7.base 1))) (and (= (select .cse2 v_arrayElimCell_60) 0) (not (= 0 v_subst_3)) (= |c_#valid| (store (store .cse2 v_arrayElimCell_60 1) v_subst_3 0)) (= (select .cse3 c_main_~p~7.base) 0))))) (not (= c_main_~p~7.offset 0)))) is different from true [2018-01-20 22:08:23,759 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_24 Int) (v_arrayElimCell_57 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_24 1))) (let ((.cse0 (store .cse1 main_~p~7.base 1))) (and (= (store (store (store .cse0 v_arrayElimCell_57 1) v_prenex_24 0) main_~p~7.base 0) |c_#valid|) (= (select .cse1 main_~p~7.base) 0) (= 0 (select .cse0 v_arrayElimCell_57)) (not (= 0 main_~p~7.base)) (not (= 0 v_prenex_24)))))) is different from true [2018-01-20 22:08:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 258 trivial. 3 not checked. [2018-01-20 22:08:23,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:23,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 26] total 38 [2018-01-20 22:08:23,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-20 22:08:23,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-20 22:08:23,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1052, Unknown=3, NotChecked=204, Total=1406 [2018-01-20 22:08:23,876 INFO L87 Difference]: Start difference. First operand 457 states and 505 transitions. Second operand 38 states. [2018-01-20 22:08:26,599 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 85 DAG size of output 83 [2018-01-20 22:08:26,880 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 85 DAG size of output 83 [2018-01-20 22:08:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:26,990 INFO L93 Difference]: Finished difference Result 947 states and 1050 transitions. [2018-01-20 22:08:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-20 22:08:26,990 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 121 [2018-01-20 22:08:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:26,993 INFO L225 Difference]: With dead ends: 947 [2018-01-20 22:08:26,993 INFO L226 Difference]: Without dead ends: 920 [2018-01-20 22:08:26,995 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=741, Invalid=4380, Unknown=3, NotChecked=426, Total=5550 [2018-01-20 22:08:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2018-01-20 22:08:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 536. [2018-01-20 22:08:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-01-20 22:08:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 600 transitions. [2018-01-20 22:08:27,062 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 600 transitions. Word has length 121 [2018-01-20 22:08:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:27,062 INFO L432 AbstractCegarLoop]: Abstraction has 536 states and 600 transitions. [2018-01-20 22:08:27,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-20 22:08:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 600 transitions. [2018-01-20 22:08:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-20 22:08:27,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:27,064 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-20 22:08:27,064 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash 91923843, now seen corresponding path program 5 times [2018-01-20 22:08:27,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:27,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:27,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:27,065 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:08:27,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:27,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:27,411 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-20 22:08:27,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:27,411 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-20 22:08:27,418 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 22:08:27,432 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,434 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,436 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,438 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,440 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,442 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,444 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,446 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,448 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,453 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,462 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,476 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:08:27,478 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:27,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:27,841 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-20 22:08:27,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:27,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-01-20 22:08:27,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-20 22:08:27,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-20 22:08:27,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=434, Unknown=0, NotChecked=0, Total=756 [2018-01-20 22:08:27,876 INFO L87 Difference]: Start difference. First operand 536 states and 600 transitions. Second operand 28 states. [2018-01-20 22:08:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:08:28,256 INFO L93 Difference]: Finished difference Result 1131 states and 1262 transitions. [2018-01-20 22:08:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 22:08:28,257 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 126 [2018-01-20 22:08:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:08:28,260 INFO L225 Difference]: With dead ends: 1131 [2018-01-20 22:08:28,261 INFO L226 Difference]: Without dead ends: 1093 [2018-01-20 22:08:28,261 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=322, Invalid=434, Unknown=0, NotChecked=0, Total=756 [2018-01-20 22:08:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-01-20 22:08:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 566. [2018-01-20 22:08:28,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-01-20 22:08:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 633 transitions. [2018-01-20 22:08:28,335 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 633 transitions. Word has length 126 [2018-01-20 22:08:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:08:28,335 INFO L432 AbstractCegarLoop]: Abstraction has 566 states and 633 transitions. [2018-01-20 22:08:28,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-20 22:08:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 633 transitions. [2018-01-20 22:08:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-20 22:08:28,337 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:08:28,337 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-20 22:08:28,337 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:08:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 162733095, now seen corresponding path program 6 times [2018-01-20 22:08:28,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:08:28,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:08:28,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:28,338 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:08:28,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:08:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:08:28,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:08:28,656 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-20 22:08:28,656 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:08:28,657 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-20 22:08:28,665 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 22:08:28,692 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:28,698 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:28,709 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:28,720 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:28,737 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:08:28,743 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:08:28,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:08:28,889 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-20 22:08:28,891 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-20 22:08:28,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:28,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:28,898 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-20 22:08:28,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:34 [2018-01-20 22:08:28,924 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-20 22:08:28,926 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 33 treesize of output 18 [2018-01-20 22:08:28,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:28,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:28,934 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-20 22:08:28,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-01-20 22:08:29,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-20 22:08:29,042 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-20 22:08:29,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:29,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:29,050 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-20 22:08:29,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-01-20 22:08:29,088 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-20 22:08:29,089 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-20 22:08:29,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:08:29,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:08:29,097 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-20 22:08:29,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:36 [2018-01-20 22:08:29,287 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_5 Int) (v_subst_4 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| main_~p~7.base 1))) (let ((.cse0 (store .cse1 v_subst_4 1))) (and (= |c_#valid| (store (store .cse0 v_subst_5 1) main_~p~7.base 0)) (= (select .cse0 v_subst_5) 0) (not (= 0 main_~p~7.base)) (= 0 (select .cse1 v_subst_4)))))) is different from true [2018-01-20 22:08:29,297 WARN L1029 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_27 Int) (v_prenex_29 Int) (v_prenex_30 Int) (v_prenex_31 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse0 (store .cse1 v_prenex_30 1))) (and (= |c_#valid| (store (store (store .cse0 v_prenex_29 1) v_prenex_27 0) v_prenex_31 0)) (= 0 (select .cse1 v_prenex_30)) (not (= 0 v_prenex_31)) (= (select .cse0 v_prenex_29) 0) (not (= 0 v_prenex_27)))))) (exists ((v_subst_5 Int) (v_subst_4 Int) (main_~p~7.base Int)) (let ((.cse3 (store |c_old(#valid)| main_~p~7.base 1))) (let ((.cse2 (store .cse3 v_subst_4 1))) (and (= |c_#valid| (store (store .cse2 v_subst_5 1) main_~p~7.base 0)) (= (select .cse2 v_subst_5) 0) (not (= 0 main_~p~7.base)) (= 0 (select .cse3 v_subst_4)))))) (and (exists ((v_prenex_28 Int) (v_prenex_33 Int) (v_prenex_32 Int)) (let ((.cse5 (store |c_old(#valid)| v_prenex_28 1))) (let ((.cse4 (store .cse5 v_prenex_33 1))) (and (not (= 0 v_prenex_28)) (= (store (store .cse4 v_prenex_32 1) v_prenex_28 0) |c_#valid|) (= (select .cse4 v_prenex_32) 0) (= 0 (select .cse5 v_prenex_33)))))) (exists ((v_prenex_34 Int)) (= 0 (select |c_#valid| v_prenex_34))))) is different from true [2018-01-20 22:08:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 369 trivial. 3 not checked. [2018-01-20 22:08:29,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:08:29,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-01-20 22:08:29,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-20 22:08:29,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-20 22:08:29,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=835, Unknown=4, NotChecked=122, Total=1122 [2018-01-20 22:08:29,405 INFO L87 Difference]: Start difference. First operand 566 states and 633 transitions. Second operand 34 states. Received shutdown request... [2018-01-20 22:08:29,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:08:29,569 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:08:29,572 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:08:29,572 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:08:29,572 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:08:29,573 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:08:29,573 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:08:29,573 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:08:29,573 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:08:29,573 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:08:29,573 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:08:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2018-01-20 22:08:29,575 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:08:29,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:08:29 BoogieIcfgContainer [2018-01-20 22:08:29,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:08:29,576 INFO L168 Benchmark]: Toolchain (without parser) took 45164.44 ms. Allocated memory was 308.3 MB in the beginning and 744.0 MB in the end (delta: 435.7 MB). Free memory was 266.6 MB in the beginning and 700.4 MB in the end (delta: -433.8 MB). Peak memory consumption was 1.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:29,578 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:08:29,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.30 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 254.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:29,578 INFO L168 Benchmark]: Boogie Preprocessor took 33.96 ms. Allocated memory is still 308.3 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:29,578 INFO L168 Benchmark]: RCFGBuilder took 334.59 ms. Allocated memory is still 308.3 MB. Free memory was 252.5 MB in the beginning and 229.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:08:29,579 INFO L168 Benchmark]: TraceAbstraction took 44570.17 ms. Allocated memory was 308.3 MB in the beginning and 744.0 MB in the end (delta: 435.7 MB). Free memory was 228.9 MB in the beginning and 700.4 MB in the end (delta: -471.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:08:29,580 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.16 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.30 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 254.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.96 ms. Allocated memory is still 308.3 MB. Free memory was 254.5 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 334.59 ms. Allocated memory is still 308.3 MB. Free memory was 252.5 MB in the beginning and 229.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44570.17 ms. Allocated memory was 308.3 MB in the beginning and 744.0 MB in the end (delta: 435.7 MB). Free memory was 228.9 MB in the beginning and 700.4 MB in the end (delta: -471.5 MB). There was no memory consumed. 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 9 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (9 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 72 locations, 4 error locations. TIMEOUT Result, 44.2s OverallTime, 30 OverallIterations, 13 TraceHistogramMax, 27.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1752 SDtfs, 10690 SDslu, 17932 SDs, 0 SdLazy, 12166 SolverSat, 2332 SolverUnsat, 210 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3126 GetRequests, 2220 SyntacticMatches, 4 SemanticMatches, 902 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 11631 ImplicationChecksByTransitivity, 25.0s 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.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 5042 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 4816 NumberOfCodeBlocks, 4638 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 4760 ConstructedInterpolants, 342 QuantifiedInterpolants, 4533471 SizeOfPredicates, 179 NumberOfNonLiveVariables, 6633 ConjunctsInSsa, 500 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-20_22-08-29-588.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-20_22-08-29-588.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-20_22-08-29-588.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-20_22-08-29-588.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-20_22-08-29-588.csv Completed graceful shutdown