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_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:34:42,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:34:42,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:34:42,511 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:34:42,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:34:42,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:34:42,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:34:42,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:34:42,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:34:42,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:34:42,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:34:42,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:34:42,521 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:34:42,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:34:42,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:34:42,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:34:42,528 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:34:42,530 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:34:42,531 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:34:42,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:34:42,535 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:34:42,535 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:34:42,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:34:42,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:34:42,538 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:34:42,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:34:42,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:34:42,540 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:34:42,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:34:42,541 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:34:42,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:34:42,542 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:34:42,550 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:34:42,550 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:34:42,551 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:34:42,551 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:34:42,551 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:34:42,551 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:34:42,552 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:34:42,552 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:34:42,552 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:34:42,552 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:34:42,552 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:34:42,552 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:34:42,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:34:42,554 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:34:42,554 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:34:42,554 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:34:42,554 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:34:42,554 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:34:42,555 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:34:42,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:34:42,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:34:42,556 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:34:42,556 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:34:42,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:34:42,598 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:34:42,601 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:34:42,603 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:34:42,603 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:34:42,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-01-23 14:34:42,787 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:34:42,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:34:42,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:34:42,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:34:42,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:34:42,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:34:42" (1/1) ... [2018-01-23 14:34:42,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11237bad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:42, skipping insertion in model container [2018-01-23 14:34:42,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:34:42" (1/1) ... [2018-01-23 14:34:42,814 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:34:42,853 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:34:42,979 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:34:42,999 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:34:43,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43 WrapperNode [2018-01-23 14:34:43,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:34:43,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:34:43,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:34:43,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:34:43,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... [2018-01-23 14:34:43,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... [2018-01-23 14:34:43,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... [2018-01-23 14:34:43,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... [2018-01-23 14:34:43,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... [2018-01-23 14:34:43,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... [2018-01-23 14:34:43,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... [2018-01-23 14:34:43,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:34:43,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:34:43,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:34:43,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:34:43,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:34:43,099 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:34:43,099 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:34:43,099 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-23 14:34:43,099 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:34:43,100 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:34:43,101 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:34:43,101 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:34:43,101 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-23 14:34:43,101 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:34:43,101 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:34:43,101 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:34:43,395 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:34:43,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:34:43 BoogieIcfgContainer [2018-01-23 14:34:43,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:34:43,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:34:43,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:34:43,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:34:43,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:34:42" (1/3) ... [2018-01-23 14:34:43,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f5960e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:34:43, skipping insertion in model container [2018-01-23 14:34:43,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:34:43" (2/3) ... [2018-01-23 14:34:43,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f5960e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:34:43, skipping insertion in model container [2018-01-23 14:34:43,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:34:43" (3/3) ... [2018-01-23 14:34:43,402 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-01-23 14:34:43,412 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:34:43,420 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:34:43,467 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:43,467 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:43,467 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:43,467 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:43,467 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:43,467 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:43,467 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:43,468 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-23 14:34:43,468 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-23 14:34:43,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:34:43,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 70 states. [2018-01-23 14:34:43,563 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-23 14:34:43,563 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:34:43,563 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-23 14:34:43,563 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-23 14:34:43,563 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:34:43,564 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 672) no Hoare annotation was computed. [2018-01-23 14:34:43,564 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 672) no Hoare annotation was computed. [2018-01-23 14:34:43,564 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 672) the Hoare annotation is: true [2018-01-23 14:34:43,564 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 672) no Hoare annotation was computed. [2018-01-23 14:34:43,564 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 672) the Hoare annotation is: true [2018-01-23 14:34:43,564 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 672) no Hoare annotation was computed. [2018-01-23 14:34:43,564 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 672) the Hoare annotation is: true [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 672) no Hoare annotation was computed. [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 672) no Hoare annotation was computed. [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point L641'''''(lines 641 648) no Hoare annotation was computed. [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point L641''''''(lines 641 648) no Hoare annotation was computed. [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point L658'''(lines 658 661) no Hoare annotation was computed. [2018-01-23 14:34:43,565 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 672) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L641(lines 641 648) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L660'(line 660) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:34:43,566 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-23 14:34:43,567 INFO L404 ceAbstractionStarter]: At program point L645'(line 645) the Hoare annotation is: true [2018-01-23 14:34:43,567 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-23 14:34:43,567 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-23 14:34:43,567 INFO L401 ceAbstractionStarter]: For program point L637'''(line 637) no Hoare annotation was computed. [2018-01-23 14:34:43,567 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 672) no Hoare annotation was computed. [2018-01-23 14:34:43,567 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-23 14:34:43,567 INFO L401 ceAbstractionStarter]: For program point L665''''(lines 665 669) no Hoare annotation was computed. [2018-01-23 14:34:43,568 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 640) no Hoare annotation was computed. [2018-01-23 14:34:43,568 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:34:43,568 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-23 14:34:43,568 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-23 14:34:43,568 INFO L404 ceAbstractionStarter]: At program point L665'''(lines 665 669) the Hoare annotation is: true [2018-01-23 14:34:43,568 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-23 14:34:43,568 INFO L401 ceAbstractionStarter]: For program point L658'(line 658) no Hoare annotation was computed. [2018-01-23 14:34:43,569 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-23 14:34:43,569 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-23 14:34:43,569 INFO L401 ceAbstractionStarter]: For program point L662(line 662) no Hoare annotation was computed. [2018-01-23 14:34:43,569 INFO L401 ceAbstractionStarter]: For program point L660(line 660) no Hoare annotation was computed. [2018-01-23 14:34:43,569 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-23 14:34:43,570 INFO L401 ceAbstractionStarter]: For program point L645'''(line 645) no Hoare annotation was computed. [2018-01-23 14:34:43,570 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-23 14:34:43,570 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-23 14:34:43,570 INFO L401 ceAbstractionStarter]: For program point L665(lines 665 669) no Hoare annotation was computed. [2018-01-23 14:34:43,570 INFO L401 ceAbstractionStarter]: For program point L667'(line 667) no Hoare annotation was computed. [2018-01-23 14:34:43,570 INFO L401 ceAbstractionStarter]: For program point L643'(line 643) no Hoare annotation was computed. [2018-01-23 14:34:43,571 INFO L404 ceAbstractionStarter]: At program point L654'''(lines 654 657) the Hoare annotation is: true [2018-01-23 14:34:43,571 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-23 14:34:43,571 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-23 14:34:43,571 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 672) no Hoare annotation was computed. [2018-01-23 14:34:43,571 INFO L401 ceAbstractionStarter]: For program point L654(lines 654 657) no Hoare annotation was computed. [2018-01-23 14:34:43,571 INFO L401 ceAbstractionStarter]: For program point L658(lines 658 661) no Hoare annotation was computed. [2018-01-23 14:34:43,571 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 672) the Hoare annotation is: true [2018-01-23 14:34:43,572 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 640) the Hoare annotation is: true [2018-01-23 14:34:43,572 INFO L401 ceAbstractionStarter]: For program point L656'(line 656) no Hoare annotation was computed. [2018-01-23 14:34:43,572 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-23 14:34:43,572 INFO L401 ceAbstractionStarter]: For program point L662''(lines 662 663) no Hoare annotation was computed. [2018-01-23 14:34:43,572 INFO L401 ceAbstractionStarter]: For program point L658''''(lines 658 661) no Hoare annotation was computed. [2018-01-23 14:34:43,572 INFO L404 ceAbstractionStarter]: At program point L637'(line 637) the Hoare annotation is: true [2018-01-23 14:34:43,573 INFO L401 ceAbstractionStarter]: For program point L665'(line 665) no Hoare annotation was computed. [2018-01-23 14:34:43,573 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-23 14:34:43,573 INFO L401 ceAbstractionStarter]: For program point L670(line 670) no Hoare annotation was computed. [2018-01-23 14:34:43,573 INFO L401 ceAbstractionStarter]: For program point L641'(line 641) no Hoare annotation was computed. [2018-01-23 14:34:43,573 INFO L401 ceAbstractionStarter]: For program point L641'''(line 641) no Hoare annotation was computed. [2018-01-23 14:34:43,573 INFO L401 ceAbstractionStarter]: For program point L666'(line 666) no Hoare annotation was computed. [2018-01-23 14:34:43,573 INFO L401 ceAbstractionStarter]: For program point L654'(line 654) no Hoare annotation was computed. [2018-01-23 14:34:43,578 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:43,578 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:43,578 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:43,579 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:43,579 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:43,579 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:43,579 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:43,579 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:34:43,579 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-23 14:34:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:34:43,583 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:43,584 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:34:43,584 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:34:43,588 INFO L82 PathProgramCache]: Analyzing trace with hash 188257, now seen corresponding path program 1 times [2018-01-23 14:34:43,590 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:43,590 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:43,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:43,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:43,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:43,659 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:34:43,664 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:43,669 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:43,669 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:43,669 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:43,669 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:43,670 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:43,670 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:43,670 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:43,670 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:34:43,670 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-23 14:34:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-23 14:34:43,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:43,676 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] [2018-01-23 14:34:43,676 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1932365681, now seen corresponding path program 1 times [2018-01-23 14:34:43,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:43,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:43,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:43,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:43,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:43,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:43,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:43,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:34:43,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:34:43,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:34:43,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:43,848 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-01-23 14:34:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:43,867 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2018-01-23 14:34:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:34:43,868 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-23 14:34:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:43,876 INFO L225 Difference]: With dead ends: 116 [2018-01-23 14:34:43,876 INFO L226 Difference]: Without dead ends: 61 [2018-01-23 14:34:43,878 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:43,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-23 14:34:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-23 14:34:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-23 14:34:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-23 14:34:43,907 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 26 [2018-01-23 14:34:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:43,907 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-23 14:34:43,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:34:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-23 14:34:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-23 14:34:43,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:43,909 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, 1] [2018-01-23 14:34:43,909 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:34:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1521926025, now seen corresponding path program 1 times [2018-01-23 14:34:43,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:43,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:43,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:43,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:43,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:34:44,002 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:34:44,011 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:44,017 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:44,017 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:34:44,033 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:34:44,033 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:34:44,033 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:34:44,033 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:34:44,033 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:34:44,033 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:34:44,033 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:34:44,033 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:34:44,034 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:34:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-01-23 14:34:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:34:44,036 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:44,036 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] [2018-01-23 14:34:44,036 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1812064646, now seen corresponding path program 1 times [2018-01-23 14:34:44,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:44,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:44,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:44,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:44,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:44,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:44,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:44,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:34:44,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:34:44,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:34:44,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:44,062 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-01-23 14:34:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:44,069 INFO L93 Difference]: Finished difference Result 116 states and 139 transitions. [2018-01-23 14:34:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:34:44,069 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-23 14:34:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:44,071 INFO L225 Difference]: With dead ends: 116 [2018-01-23 14:34:44,071 INFO L226 Difference]: Without dead ends: 59 [2018-01-23 14:34:44,072 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:34:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-23 14:34:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-23 14:34:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-23 14:34:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-01-23 14:34:44,078 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 24 [2018-01-23 14:34:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:44,079 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-01-23 14:34:44,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:34:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-01-23 14:34:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-23 14:34:44,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:44,080 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] [2018-01-23 14:34:44,081 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash 314432500, now seen corresponding path program 1 times [2018-01-23 14:34:44,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:44,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:44,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:44,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:44,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:44,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:44,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:34:44,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:34:44,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:34:44,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:34:44,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:34:44,298 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 6 states. [2018-01-23 14:34:44,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:44,619 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-01-23 14:34:44,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:34:44,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-23 14:34:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:44,621 INFO L225 Difference]: With dead ends: 118 [2018-01-23 14:34:44,621 INFO L226 Difference]: Without dead ends: 114 [2018-01-23 14:34:44,622 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-23 14:34:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-23 14:34:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2018-01-23 14:34:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-23 14:34:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-01-23 14:34:44,630 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 36 [2018-01-23 14:34:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:44,631 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-01-23 14:34:44,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:34:44,631 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-01-23 14:34:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-23 14:34:44,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:44,632 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, 1] [2018-01-23 14:34:44,632 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:44,632 INFO L82 PathProgramCache]: Analyzing trace with hash 721961098, now seen corresponding path program 1 times [2018-01-23 14:34:44,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:44,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:44,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:44,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:44,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:44,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:44,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:44,935 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:44,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:45,009 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:45,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:34:45,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:45,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:45,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:45,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:45,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-23 14:34:45,156 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 17 treesize of output 13 [2018-01-23 14:34:45,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:45,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:34:45,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:45,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:45,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2018-01-23 14:34:45,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-23 14:34:45,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:34:45,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:45,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:45,285 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 14 treesize of output 12 [2018-01-23 14:34:45,287 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 7 treesize of output 1 [2018-01-23 14:34:45,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:45,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:45,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:45,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:9 [2018-01-23 14:34:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:45,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:45,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2018-01-23 14:34:45,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-23 14:34:45,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-23 14:34:45,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:34:45,425 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 19 states. [2018-01-23 14:34:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:46,070 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-01-23 14:34:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:34:46,070 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-01-23 14:34:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:46,071 INFO L225 Difference]: With dead ends: 159 [2018-01-23 14:34:46,071 INFO L226 Difference]: Without dead ends: 105 [2018-01-23 14:34:46,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2018-01-23 14:34:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-23 14:34:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2018-01-23 14:34:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-23 14:34:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2018-01-23 14:34:46,083 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 43 [2018-01-23 14:34:46,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:46,083 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-01-23 14:34:46,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-23 14:34:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2018-01-23 14:34:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:34:46,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:46,085 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:46,085 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2120407862, now seen corresponding path program 1 times [2018-01-23 14:34:46,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:46,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:46,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:46,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:46,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:46,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:46,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:46,426 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:46,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:46,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:46,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:34:46,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:34:46,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:34:46,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:46,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-23 14:34:46,558 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:46,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:46,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:34:46,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-23 14:34:46,583 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 27 treesize of output 22 [2018-01-23 14:34:46,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:46,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-23 14:34:46,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:46,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:46,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:24 [2018-01-23 14:34:46,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-23 14:34:46,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:34:46,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-01-23 14:34:46,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:34:46,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:46,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:19 [2018-01-23 14:34:46,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-23 14:34:46,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:46,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-23 14:34:46,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:46,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-01-23 14:34:46,889 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 22 treesize of output 20 [2018-01-23 14:34:46,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:34:46,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:34:46,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:46,903 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-01-23 14:34:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:46,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:46,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2018-01-23 14:34:46,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-23 14:34:46,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-23 14:34:46,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:34:46,944 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 18 states. [2018-01-23 14:34:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:47,672 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2018-01-23 14:34:47,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-23 14:34:47,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-01-23 14:34:47,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:47,674 INFO L225 Difference]: With dead ends: 184 [2018-01-23 14:34:47,674 INFO L226 Difference]: Without dead ends: 170 [2018-01-23 14:34:47,674 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 14 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2018-01-23 14:34:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-01-23 14:34:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 87. [2018-01-23 14:34:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-23 14:34:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2018-01-23 14:34:47,684 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 47 [2018-01-23 14:34:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:47,684 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2018-01-23 14:34:47,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-23 14:34:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2018-01-23 14:34:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:34:47,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:47,686 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:34:47,686 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:47,686 INFO L82 PathProgramCache]: Analyzing trace with hash -66654106, now seen corresponding path program 1 times [2018-01-23 14:34:47,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:47,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:47,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:47,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:47,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:47,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:47,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:47,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:47,927 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:47,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:47,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:47,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:34:47,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:47,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:47,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:34:47,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:34:47,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:47,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:47,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:47,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:47,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-23 14:34:47,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:47,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:47,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:34:47,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:47,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:47,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-23 14:34:48,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:48,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:48,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,030 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 27 treesize of output 22 [2018-01-23 14:34:48,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:48,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-23 14:34:48,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:24 [2018-01-23 14:34:48,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-23 14:34:48,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:34:48,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-01-23 14:34:48,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:34:48,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:48,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:19 [2018-01-23 14:34:48,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-23 14:34:48,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:48,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-23 14:34:48,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:48,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-01-23 14:34:48,346 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 22 treesize of output 20 [2018-01-23 14:34:48,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:34:48,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:34:48,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:48,370 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-01-23 14:34:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:48,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:48,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2018-01-23 14:34:48,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-23 14:34:48,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-23 14:34:48,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-01-23 14:34:48,406 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 18 states. [2018-01-23 14:34:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:49,097 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2018-01-23 14:34:49,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-23 14:34:49,098 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-01-23 14:34:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:49,099 INFO L225 Difference]: With dead ends: 213 [2018-01-23 14:34:49,099 INFO L226 Difference]: Without dead ends: 194 [2018-01-23 14:34:49,100 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 18 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=939, Unknown=0, NotChecked=0, Total=1190 [2018-01-23 14:34:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-23 14:34:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 108. [2018-01-23 14:34:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-23 14:34:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-01-23 14:34:49,112 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 47 [2018-01-23 14:34:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:49,112 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-01-23 14:34:49,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-23 14:34:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-01-23 14:34:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:34:49,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:49,114 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] [2018-01-23 14:34:49,114 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1914201691, now seen corresponding path program 1 times [2018-01-23 14:34:49,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:49,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:49,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:49,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:49,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:49,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:34:49,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:49,459 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:49,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:49,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:49,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:34:49,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:34:49,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:49,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:49,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:34:49,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-23 14:34:49,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:49,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:49,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-23 14:34:49,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:49,712 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 39 treesize of output 40 [2018-01-23 14:34:49,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:34:49,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-01-23 14:34:49,729 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-23 14:34:49,731 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 14 treesize of output 13 [2018-01-23 14:34:49,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:49,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-23 14:34:49,851 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-01-23 14:34:49,853 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 7 treesize of output 1 [2018-01-23 14:34:49,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:49,861 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-23 14:34:49,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:34:49,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:49,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:49,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2018-01-23 14:34:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:34:49,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:49,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-23 14:34:49,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-23 14:34:49,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-23 14:34:49,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-01-23 14:34:49,930 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 25 states. [2018-01-23 14:34:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:50,732 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2018-01-23 14:34:50,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-23 14:34:50,752 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-01-23 14:34:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:50,753 INFO L225 Difference]: With dead ends: 180 [2018-01-23 14:34:50,753 INFO L226 Difference]: Without dead ends: 176 [2018-01-23 14:34:50,754 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:34:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-23 14:34:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2018-01-23 14:34:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-23 14:34:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-01-23 14:34:50,765 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 52 [2018-01-23 14:34:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:50,765 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-01-23 14:34:50,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-23 14:34:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-01-23 14:34:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-23 14:34:50,766 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:50,766 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] [2018-01-23 14:34:50,766 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:50,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1922752128, now seen corresponding path program 1 times [2018-01-23 14:34:50,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:50,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:50,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:50,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:50,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:50,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:34:51,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:51,009 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:51,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:51,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:51,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:34:51,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:34:51,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:51,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:51,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-23 14:34:51,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-23 14:34:51,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:51,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:51,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-23 14:34:51,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:51,206 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 39 treesize of output 40 [2018-01-23 14:34:51,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:34:51,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-01-23 14:34:51,222 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-23 14:34:51,225 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 14 treesize of output 13 [2018-01-23 14:34:51,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:51,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-23 14:34:51,301 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-01-23 14:34:51,303 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 7 treesize of output 1 [2018-01-23 14:34:51,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:51,311 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-23 14:34:51,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:34:51,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:51,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:51,319 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2018-01-23 14:34:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:34:51,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:51,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-23 14:34:51,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-23 14:34:51,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-23 14:34:51,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-01-23 14:34:51,378 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 25 states. [2018-01-23 14:34:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:52,374 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2018-01-23 14:34:52,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-23 14:34:52,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-01-23 14:34:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:52,376 INFO L225 Difference]: With dead ends: 210 [2018-01-23 14:34:52,376 INFO L226 Difference]: Without dead ends: 206 [2018-01-23 14:34:52,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2018-01-23 14:34:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-01-23 14:34:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 124. [2018-01-23 14:34:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-23 14:34:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-01-23 14:34:52,387 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 52 [2018-01-23 14:34:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:52,387 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-01-23 14:34:52,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-23 14:34:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-01-23 14:34:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:34:52,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:52,388 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-23 14:34:52,388 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 331685556, now seen corresponding path program 2 times [2018-01-23 14:34:52,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:52,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:52,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:52,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:52,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:52,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:52,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:52,698 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:52,702 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:34:52,716 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:52,724 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:52,726 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:52,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:52,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:34:52,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:34:52,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:52,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:52,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-23 14:34:52,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-23 14:34:52,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:52,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:52,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:43 [2018-01-23 14:34:52,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:52,966 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 48 treesize of output 49 [2018-01-23 14:34:52,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:34:52,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:38 [2018-01-23 14:34:52,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:52,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:52,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:52,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:34:52,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:52,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:36 [2018-01-23 14:34:53,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:53,033 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 45 treesize of output 46 [2018-01-23 14:34:53,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:53,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-01-23 14:34:53,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:53,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:53,156 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-01-23 14:34:53,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:34:53,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:53,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:52 [2018-01-23 14:34:53,202 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 82 treesize of output 67 [2018-01-23 14:34:53,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-23 14:34:53,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,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-23 14:34:53,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:68 [2018-01-23 14:34:53,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2018-01-23 14:34:53,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2018-01-23 14:34:53,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:34:53,333 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 7 treesize of output 1 [2018-01-23 14:34:53,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:34:53,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-01-23 14:34:53,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:53,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:53,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:34:53,351 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:77, output treesize:11 [2018-01-23 14:34:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:53,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:53,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-23 14:34:53,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-23 14:34:53,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-23 14:34:53,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2018-01-23 14:34:53,426 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 37 states. [2018-01-23 14:34:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:56,070 INFO L93 Difference]: Finished difference Result 301 states and 337 transitions. [2018-01-23 14:34:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-23 14:34:56,071 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 58 [2018-01-23 14:34:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:56,072 INFO L225 Difference]: With dead ends: 301 [2018-01-23 14:34:56,072 INFO L226 Difference]: Without dead ends: 287 [2018-01-23 14:34:56,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=844, Invalid=4558, Unknown=0, NotChecked=0, Total=5402 [2018-01-23 14:34:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-01-23 14:34:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 155. [2018-01-23 14:34:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-23 14:34:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2018-01-23 14:34:56,084 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 58 [2018-01-23 14:34:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:56,084 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2018-01-23 14:34:56,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-23 14:34:56,085 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2018-01-23 14:34:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:34:56,085 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:56,086 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:34:56,086 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1803611012, now seen corresponding path program 1 times [2018-01-23 14:34:56,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:56,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:56,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:56,086 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:34:56,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:56,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:56,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:56,388 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:56,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:56,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:56,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:34:56,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:34:56,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-23 14:34:56,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:56,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-23 14:34:56,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-23 14:34:56,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-01-23 14:34:56,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:56,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:56,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,521 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 27 treesize of output 22 [2018-01-23 14:34:56,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-23 14:34:56,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:40 [2018-01-23 14:34:56,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, 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-23 14:34:56,559 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 10 [2018-01-23 14:34:56,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2018-01-23 14:34:56,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-23 14:34:56,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:56,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-23 14:34:56,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,638 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-23 14:34:56,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-01-23 14:34:56,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:56,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:56,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-23 14:34:56,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-23 14:34:56,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:39 [2018-01-23 14:34:56,748 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 30 treesize of output 24 [2018-01-23 14:34:56,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-01-23 14:34:56,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:56,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:27 [2018-01-23 14:34:56,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-23 14:34:56,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-23 14:34:56,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:56,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-01-23 14:34:56,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-01-23 14:34:56,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:56,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-23 14:34:56,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:56,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:56,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:34 [2018-01-23 14:34:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:57,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:34:57,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 34 [2018-01-23 14:34:57,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-23 14:34:57,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-23 14:34:57,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2018-01-23 14:34:57,010 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand 34 states. [2018-01-23 14:34:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:34:58,511 INFO L93 Difference]: Finished difference Result 353 states and 396 transitions. [2018-01-23 14:34:58,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-23 14:34:58,512 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58 [2018-01-23 14:34:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:34:58,513 INFO L225 Difference]: With dead ends: 353 [2018-01-23 14:34:58,513 INFO L226 Difference]: Without dead ends: 334 [2018-01-23 14:34:58,514 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1302 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=660, Invalid=3762, Unknown=0, NotChecked=0, Total=4422 [2018-01-23 14:34:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-23 14:34:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 172. [2018-01-23 14:34:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-23 14:34:58,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 197 transitions. [2018-01-23 14:34:58,530 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 197 transitions. Word has length 58 [2018-01-23 14:34:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:34:58,530 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 197 transitions. [2018-01-23 14:34:58,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-23 14:34:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 197 transitions. [2018-01-23 14:34:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:34:58,531 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:34:58,531 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-23 14:34:58,531 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:34:58,531 INFO L82 PathProgramCache]: Analyzing trace with hash -383450956, now seen corresponding path program 2 times [2018-01-23 14:34:58,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:34:58,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:34:58,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:58,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:34:58,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:34:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:34:58,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:34:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:34:59,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:34:59,227 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:34:59,237 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:34:59,253 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:59,262 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:34:59,265 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:34:59,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:34:59,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:34:59,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:34:59,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-23 14:34:59,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-23 14:34:59,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:34:59,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:59,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:43 [2018-01-23 14:34:59,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,644 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 48 treesize of output 49 [2018-01-23 14:34:59,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:34:59,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:38 [2018-01-23 14:34:59,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:34:59,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:36 [2018-01-23 14:34:59,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,763 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 45 treesize of output 46 [2018-01-23 14:34:59,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:34:59,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-01-23 14:34:59,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:34:59,888 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-01-23 14:34:59,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:34:59,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:59,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:62 [2018-01-23 14:34:59,931 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 82 treesize of output 67 [2018-01-23 14:34:59,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-23 14:34:59,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:34:59,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:34:59,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:68 [2018-01-23 14:35:00,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2018-01-23 14:35:00,040 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 7 treesize of output 1 [2018-01-23 14:35:00,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:00,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2018-01-23 14:35:00,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:35:00,062 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-23 14:35:00,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:00,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-01-23 14:35:00,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:00,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:00,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:00,072 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:77, output treesize:11 [2018-01-23 14:35:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:00,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:00,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-23 14:35:00,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-23 14:35:00,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-23 14:35:00,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2018-01-23 14:35:00,156 INFO L87 Difference]: Start difference. First operand 172 states and 197 transitions. Second operand 37 states. [2018-01-23 14:35:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:03,307 INFO L93 Difference]: Finished difference Result 374 states and 422 transitions. [2018-01-23 14:35:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-23 14:35:03,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 58 [2018-01-23 14:35:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:03,309 INFO L225 Difference]: With dead ends: 374 [2018-01-23 14:35:03,309 INFO L226 Difference]: Without dead ends: 355 [2018-01-23 14:35:03,310 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=877, Invalid=4823, Unknown=0, NotChecked=0, Total=5700 [2018-01-23 14:35:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-01-23 14:35:03,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 191. [2018-01-23 14:35:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-23 14:35:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 222 transitions. [2018-01-23 14:35:03,326 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 222 transitions. Word has length 58 [2018-01-23 14:35:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:03,327 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 222 transitions. [2018-01-23 14:35:03,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-23 14:35:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 222 transitions. [2018-01-23 14:35:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-23 14:35:03,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:03,328 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:35:03,328 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1869616711, now seen corresponding path program 1 times [2018-01-23 14:35:03,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:03,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:03,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:03,329 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:03,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:03,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:35:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:04,055 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:04,055 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:35:04,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:04,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:04,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:04,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-01-23 14:35:04,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-01-23 14:35:04,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:04,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:04,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-01-23 14:35:04,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:04,373 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 49 treesize of output 50 [2018-01-23 14:35:04,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:04,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:51 [2018-01-23 14:35:04,399 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-23 14:35:04,404 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 14 treesize of output 13 [2018-01-23 14:35:04,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:04,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-23 14:35:04,898 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-01-23 14:35:04,900 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 7 treesize of output 1 [2018-01-23 14:35:04,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,917 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2018-01-23 14:35:04,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:04,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:04,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-01-23 14:35:04,974 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 7 treesize of output 1 [2018-01-23 14:35:04,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-01-23 14:35:04,986 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 7 treesize of output 1 [2018-01-23 14:35:04,986 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:04,994 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:05,037 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 82 treesize of output 78 [2018-01-23 14:35:05,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:35:05,042 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:05,065 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:05,108 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2018-01-23 14:35:05,113 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 7 treesize of output 1 [2018-01-23 14:35:05,113 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:05,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-01-23 14:35:05,134 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:05,149 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:05,197 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 4 xjuncts. [2018-01-23 14:35:05,197 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:165, output treesize:145 [2018-01-23 14:35:05,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:05,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-01-23 14:35:05,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:05,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:05,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-01-23 14:35:05,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:05,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:05,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:59 [2018-01-23 14:35:05,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:05,700 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:05,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-23 14:35:05,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:05,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:05,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-01-23 14:35:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:05,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:05,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2018-01-23 14:35:05,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:35:05,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:35:05,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1461, Unknown=2, NotChecked=0, Total=1560 [2018-01-23 14:35:05,840 INFO L87 Difference]: Start difference. First operand 191 states and 222 transitions. Second operand 40 states. [2018-01-23 14:35:07,071 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 127 DAG size of output 63 [2018-01-23 14:35:07,720 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 53 DAG size of output 34 [2018-01-23 14:35:08,621 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 131 DAG size of output 58 [2018-01-23 14:35:08,807 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 133 DAG size of output 58 [2018-01-23 14:35:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:09,498 INFO L93 Difference]: Finished difference Result 260 states and 297 transitions. [2018-01-23 14:35:09,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-23 14:35:09,498 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2018-01-23 14:35:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:09,499 INFO L225 Difference]: With dead ends: 260 [2018-01-23 14:35:09,499 INFO L226 Difference]: Without dead ends: 191 [2018-01-23 14:35:09,500 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=338, Invalid=3442, Unknown=2, NotChecked=0, Total=3782 [2018-01-23 14:35:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-23 14:35:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-01-23 14:35:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-23 14:35:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 221 transitions. [2018-01-23 14:35:09,510 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 221 transitions. Word has length 59 [2018-01-23 14:35:09,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:09,510 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 221 transitions. [2018-01-23 14:35:09,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:35:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 221 transitions. [2018-01-23 14:35:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-23 14:35:09,511 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:09,511 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-23 14:35:09,511 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash 973703294, now seen corresponding path program 1 times [2018-01-23 14:35:09,511 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:09,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:09,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:09,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:09,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:09,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:35:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:10,333 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:10,333 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:35:10,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:10,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:10,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:10,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2018-01-23 14:35:10,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-01-23 14:35:10,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:10,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:10,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:56 [2018-01-23 14:35:10,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:10,623 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 49 treesize of output 50 [2018-01-23 14:35:10,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:10,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:51 [2018-01-23 14:35:10,642 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-23 14:35:10,644 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 14 treesize of output 13 [2018-01-23 14:35:10,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:10,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:10,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-23 14:35:10,998 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-01-23 14:35:10,999 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 7 treesize of output 1 [2018-01-23 14:35:10,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-01-23 14:35:11,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:11,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:11,067 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 71 [2018-01-23 14:35:11,073 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2018-01-23 14:35:11,074 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:11,093 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 7 treesize of output 1 [2018-01-23 14:35:11,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:11,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-01-23 14:35:11,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:35:11,159 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,165 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-01-23 14:35:11,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-23 14:35:11,168 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,176 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-01-23 14:35:11,221 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 7 treesize of output 1 [2018-01-23 14:35:11,221 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,227 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-01-23 14:35:11,231 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 7 treesize of output 1 [2018-01-23 14:35:11,231 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,239 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,276 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 4 xjuncts. [2018-01-23 14:35:11,277 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:165, output treesize:145 [2018-01-23 14:35:11,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:11,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-23 14:35:11,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:11,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-23 14:35:11,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:11,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:59 [2018-01-23 14:35:11,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:11,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:11,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-23 14:35:11,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:11,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:11,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-01-23 14:35:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:11,732 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:11,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 39 [2018-01-23 14:35:11,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:35:11,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:35:11,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1459, Unknown=4, NotChecked=0, Total=1560 [2018-01-23 14:35:11,733 INFO L87 Difference]: Start difference. First operand 191 states and 221 transitions. Second operand 40 states. [2018-01-23 14:35:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:14,449 INFO L93 Difference]: Finished difference Result 267 states and 303 transitions. [2018-01-23 14:35:14,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-23 14:35:14,450 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 59 [2018-01-23 14:35:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:14,450 INFO L225 Difference]: With dead ends: 267 [2018-01-23 14:35:14,450 INFO L226 Difference]: Without dead ends: 198 [2018-01-23 14:35:14,452 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=338, Invalid=3440, Unknown=4, NotChecked=0, Total=3782 [2018-01-23 14:35:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-23 14:35:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-01-23 14:35:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-23 14:35:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-01-23 14:35:14,462 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 59 [2018-01-23 14:35:14,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:14,462 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-01-23 14:35:14,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:35:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-01-23 14:35:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-23 14:35:14,463 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:14,463 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:35:14,463 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1247225378, now seen corresponding path program 1 times [2018-01-23 14:35:14,463 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:14,463 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:14,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:14,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:14,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:14,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:35:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:15,257 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:15,257 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:35:15,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:15,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:15,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:35:15,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:35:15,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-23 14:35:15,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-23 14:35:15,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:15,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:15,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:43 [2018-01-23 14:35:15,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,476 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 48 treesize of output 49 [2018-01-23 14:35:15,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:15,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:38 [2018-01-23 14:35:15,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:35:15,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:36 [2018-01-23 14:35:15,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,565 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 45 treesize of output 46 [2018-01-23 14:35:15,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:15,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-01-23 14:35:15,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:15,689 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-01-23 14:35:15,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:15,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:15,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:52 [2018-01-23 14:35:15,738 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 82 treesize of output 67 [2018-01-23 14:35:15,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-23 14:35:15,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:15,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:68 [2018-01-23 14:35:15,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2018-01-23 14:35:15,842 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 7 treesize of output 1 [2018-01-23 14:35:15,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-01-23 14:35:15,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:15,856 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-23 14:35:15,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:35:15,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:15,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:15,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:11 [2018-01-23 14:35:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:35:15,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:15,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 40 [2018-01-23 14:35:15,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:35:15,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:35:15,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2018-01-23 14:35:15,946 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 40 states. [2018-01-23 14:35:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:18,562 INFO L93 Difference]: Finished difference Result 332 states and 372 transitions. [2018-01-23 14:35:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-23 14:35:18,562 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 63 [2018-01-23 14:35:18,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:18,563 INFO L225 Difference]: With dead ends: 332 [2018-01-23 14:35:18,563 INFO L226 Difference]: Without dead ends: 328 [2018-01-23 14:35:18,565 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=878, Invalid=4822, Unknown=0, NotChecked=0, Total=5700 [2018-01-23 14:35:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-01-23 14:35:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 213. [2018-01-23 14:35:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-23 14:35:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 246 transitions. [2018-01-23 14:35:18,576 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 246 transitions. Word has length 63 [2018-01-23 14:35:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:18,577 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 246 transitions. [2018-01-23 14:35:18,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:35:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 246 transitions. [2018-01-23 14:35:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-23 14:35:18,577 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:18,577 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2018-01-23 14:35:18,578 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 840515190, now seen corresponding path program 2 times [2018-01-23 14:35:18,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:18,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:18,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:18,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:18,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:18,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:35:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:19,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35: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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:35:19,336 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:35:19,349 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:19,358 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:19,362 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:19,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:19,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:35:19,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-23 14:35:19,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-23 14:35:19,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-23 14:35:19,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:19,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:19,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:43 [2018-01-23 14:35:19,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,604 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 56 treesize of output 57 [2018-01-23 14:35:19,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:19,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:46 [2018-01-23 14:35:19,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-01-23 14:35:19,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:65 [2018-01-23 14:35:19,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,704 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 64 treesize of output 65 [2018-01-23 14:35:19,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:19,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:83 [2018-01-23 14:35:19,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,854 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2018-01-23 14:35:19,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 12 treesize of output 1 [2018-01-23 14:35:19,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:19,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:107 [2018-01-23 14:35:19,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:19,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-01-23 14:35:19,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:19,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:19,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:112, output treesize:104 [2018-01-23 14:35:20,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:20,025 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:20,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2018-01-23 14:35:20,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:20,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:20,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:122 [2018-01-23 14:35:20,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:20,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:20,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:20,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 152 [2018-01-23 14:35:20,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:20,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:20,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:146 [2018-01-23 14:35:20,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 126 [2018-01-23 14:35:20,291 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 28 treesize of output 27 [2018-01-23 14:35:20,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:20,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:192, output treesize:170 [2018-01-23 14:35:20,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 97 [2018-01-23 14:35:20,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-01-23 14:35:20,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-01-23 14:35:20,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,455 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 7 treesize of output 1 [2018-01-23 14:35:20,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-01-23 14:35:20,460 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:20,464 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:179, output treesize:4 [2018-01-23 14:35:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:20,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:20,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 49 [2018-01-23 14:35:20,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-23 14:35:20,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-23 14:35:20,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2171, Unknown=0, NotChecked=0, Total=2352 [2018-01-23 14:35:20,539 INFO L87 Difference]: Start difference. First operand 213 states and 246 transitions. Second operand 49 states. [2018-01-23 14:35:22,348 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 103 DAG size of output 73 [2018-01-23 14:35:22,660 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 124 DAG size of output 87 [2018-01-23 14:35:25,082 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 120 DAG size of output 91 [2018-01-23 14:35:25,371 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 138 DAG size of output 103 [2018-01-23 14:35:28,185 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 96 DAG size of output 63 [2018-01-23 14:35:28,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:28,587 INFO L93 Difference]: Finished difference Result 484 states and 548 transitions. [2018-01-23 14:35:28,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-01-23 14:35:28,587 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 69 [2018-01-23 14:35:28,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:28,589 INFO L225 Difference]: With dead ends: 484 [2018-01-23 14:35:28,589 INFO L226 Difference]: Without dead ends: 465 [2018-01-23 14:35:28,593 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4166 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2130, Invalid=12632, Unknown=0, NotChecked=0, Total=14762 [2018-01-23 14:35:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-01-23 14:35:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 235. [2018-01-23 14:35:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-01-23 14:35:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 272 transitions. [2018-01-23 14:35:28,615 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 272 transitions. Word has length 69 [2018-01-23 14:35:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:28,615 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 272 transitions. [2018-01-23 14:35:28,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-23 14:35:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 272 transitions. [2018-01-23 14:35:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-23 14:35:28,616 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:28,617 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-23 14:35:28,617 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash -769466313, now seen corresponding path program 2 times [2018-01-23 14:35:28,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:28,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:28,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:28,618 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:28,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:28,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:35:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:29,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:29,400 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:35:29,405 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:35:29,417 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:29,427 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:29,430 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:29,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:29,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:35:29,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:35:29,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-23 14:35:29,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-23 14:35:29,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:29,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:29,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:29,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:29,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-23 14:35:29,573 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-23 14:35:29,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:35:29,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-01-23 14:35:29,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,646 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 40 treesize of output 41 [2018-01-23 14:35:29,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:29,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,662 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 12 [2018-01-23 14:35:29,663 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 11 [2018-01-23 14:35:29,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:47 [2018-01-23 14:35:29,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-23 14:35:29,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-01-23 14:35:29,785 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 31 treesize of output 33 [2018-01-23 14:35:29,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,788 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 26 treesize of output 37 [2018-01-23 14:35:29,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-01-23 14:35:29,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-23 14:35:29,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2018-01-23 14:35:29,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,939 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 23 treesize of output 36 [2018-01-23 14:35:29,941 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 16 treesize of output 15 [2018-01-23 14:35:29,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,957 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:29,961 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 97 [2018-01-23 14:35:29,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:29,963 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:29,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:69 [2018-01-23 14:35:30,025 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 70 treesize of output 65 [2018-01-23 14:35:30,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:30,028 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 38 treesize of output 22 [2018-01-23 14:35:30,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,042 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:30,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:30,048 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 84 treesize of output 83 [2018-01-23 14:35:30,049 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 18 treesize of output 17 [2018-01-23 14:35:30,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:35:30,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:130, output treesize:75 [2018-01-23 14:35:30,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:30,279 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:35:30,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 53 [2018-01-23 14:35:30,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-23 14:35:30,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-23 14:35:30,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-23 14:35:30,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:30,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-23 14:35:30,304 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:112 [2018-01-23 14:35:30,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:30,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:30,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-01-23 14:35:30,507 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-01-23 14:35:30,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:35:30,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,518 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 7 treesize of output 1 [2018-01-23 14:35:30,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,523 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 16 treesize of output 12 [2018-01-23 14:35:30,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-23 14:35:30,525 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,526 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:30,528 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:4 [2018-01-23 14:35:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:30,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:30,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2018-01-23 14:35:30,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-23 14:35:30,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-23 14:35:30,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2023, Unknown=0, NotChecked=0, Total=2162 [2018-01-23 14:35:30,707 INFO L87 Difference]: Start difference. First operand 235 states and 272 transitions. Second operand 47 states. [2018-01-23 14:35:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:33,826 INFO L93 Difference]: Finished difference Result 350 states and 396 transitions. [2018-01-23 14:35:33,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-23 14:35:33,864 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 70 [2018-01-23 14:35:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:33,865 INFO L225 Difference]: With dead ends: 350 [2018-01-23 14:35:33,865 INFO L226 Difference]: Without dead ends: 321 [2018-01-23 14:35:33,866 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=682, Invalid=6290, Unknown=0, NotChecked=0, Total=6972 [2018-01-23 14:35:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-23 14:35:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 260. [2018-01-23 14:35:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-23 14:35:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 299 transitions. [2018-01-23 14:35:33,885 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 299 transitions. Word has length 70 [2018-01-23 14:35:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:33,885 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 299 transitions. [2018-01-23 14:35:33,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-23 14:35:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 299 transitions. [2018-01-23 14:35:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-23 14:35:33,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:33,886 INFO L322 BasicCegarLoop]: trace histogram [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, 1] [2018-01-23 14:35:33,886 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1497512292, now seen corresponding path program 1 times [2018-01-23 14:35:33,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:33,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:33,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:33,887 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:33,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:33,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:35:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:34,711 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:34,711 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:35:34,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:34,748 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:34,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-23 14:35:34,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:35:34,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:34,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:34,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-23 14:35:34,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-23 14:35:34,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:34,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:34,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:35:34,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:35:34,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,852 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-23 14:35:34,884 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-23 14:35:34,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:35:34,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:34,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 Received shutdown request... [2018-01-23 14:35:34,907 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-23 14:35:34,907 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:35:34,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:35:34 BoogieIcfgContainer [2018-01-23 14:35:34,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:35:34,909 INFO L168 Benchmark]: Toolchain (without parser) took 52121.97 ms. Allocated memory was 304.6 MB in the beginning and 759.2 MB in the end (delta: 454.6 MB). Free memory was 263.5 MB in the beginning and 640.8 MB in the end (delta: -377.3 MB). Peak memory consumption was 77.3 MB. Max. memory is 5.3 GB. [2018-01-23 14:35:34,910 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:35:34,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.99 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 251.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:35:34,910 INFO L168 Benchmark]: Boogie Preprocessor took 40.01 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:35:34,910 INFO L168 Benchmark]: RCFGBuilder took 345.72 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 226.6 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-23 14:35:34,911 INFO L168 Benchmark]: TraceAbstraction took 51511.80 ms. Allocated memory was 304.6 MB in the beginning and 759.2 MB in the end (delta: 454.6 MB). Free memory was 226.6 MB in the beginning and 640.8 MB in the end (delta: -414.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:35:34,912 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.15 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.99 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 251.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.01 ms. Allocated memory is still 304.6 MB. Free memory was 251.6 MB in the beginning and 249.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 345.72 ms. Allocated memory is still 304.6 MB. Free memory was 249.6 MB in the beginning and 226.6 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51511.80 ms. Allocated memory was 304.6 MB in the beginning and 759.2 MB in the end (delta: 454.6 MB). Free memory was 226.6 MB in the beginning and 640.8 MB in the end (delta: -414.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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, 73 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=70occurred 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, 73 locations, 4 error locations. UNSAFE Result, 0.0s 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=70occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] int i = 0; [L628] int y = 0; VAL [i=0, y=0] [L629] EXPR, FCALL malloc(sizeof(struct node)) VAL [i=0, malloc(sizeof(struct node))={13:0}, y=0] [L629] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, y=0] [L630] COND FALSE !(a == 0) VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, y=0] [L631] List t; [L632] List p = a; VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L633] i < 10 && __VERIFIER_nondet_int() [L633] i < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={13:0}, i=0, i < 10 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L633] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L641] y < 10 && __VERIFIER_nondet_int() [L641] y < 10 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0, y < 10 && __VERIFIER_nondet_int()=0] [L641] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L649] FCALL p->h = 3 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L650] FCALL p->n = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L651] i = 0 [L652] y = 0 [L653] p = a VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L654] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=3, y=0] [L654] COND FALSE !(p->h == 1) [L658] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=3, y=0] [L658] COND FALSE !(p->h == 2) [L662] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=3, y=0] [L662] COND FALSE !(p->h != 3 || (i + y) > 20) [L664] p = a VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L665] EXPR, FCALL p->n VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}, y=0] [L665] COND FALSE !(p->n != 0) [L670] FCALL free(p) VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, y=0] [L671] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 73 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 29 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 73 locations, 4 error locations. TIMEOUT Result, 50.8s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 31.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1091 SDtfs, 6637 SDslu, 18535 SDs, 0 SdLazy, 19149 SolverSat, 1774 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1381 GetRequests, 528 SyntacticMatches, 69 SemanticMatches, 784 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12809 ImplicationChecksByTransitivity, 30.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=15, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 1240 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 1530 NumberOfCodeBlocks, 1530 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1502 ConstructedInterpolants, 236 QuantifiedInterpolants, 2198546 SizeOfPredicates, 246 NumberOfNonLiveVariables, 2316 ConjunctsInSsa, 606 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 18/300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-35-34-918.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-35-34-918.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-35-34-918.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-35-34-918.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-35-34-918.csv Completed graceful shutdown