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/simple-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:35:37,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:35:37,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:35:37,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:35:37,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:35:37,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:35:37,426 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:35:37,428 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:35:37,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:35:37,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:35:37,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:35:37,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:35:37,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:35:37,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:35:37,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:35:37,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:35:37,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:35:37,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:35:37,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:35:37,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:35:37,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:35:37,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:35:37,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:35:37,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:35:37,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:35:37,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:35:37,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:35:37,450 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:35:37,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:35:37,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:35:37,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:35:37,451 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:35:37,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:35:37,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:35:37,462 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:35:37,462 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:35:37,463 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:35:37,463 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:35:37,463 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:35:37,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:35:37,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:35:37,464 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:35:37,464 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:35:37,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:35:37,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:35:37,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:35:37,465 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:35:37,465 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:35:37,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:35:37,465 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:35:37,466 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:35:37,466 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:35:37,466 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:35:37,466 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:35:37,466 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:35:37,467 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:35:37,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:35:37,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:35:37,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:35:37,467 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:35:37,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:35:37,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:35:37,468 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:35:37,468 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:35:37,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:35:37,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:35:37,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:35:37,469 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:35:37,470 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:35:37,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:35:37,517 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:35:37,521 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:35:37,522 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:35:37,523 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:35:37,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-01-23 14:35:37,717 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:35:37,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:35:37,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:35:37,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:35:37,731 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:35:37,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4454cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37, skipping insertion in model container [2018-01-23 14:35:37,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,753 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:35:37,792 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:35:37,912 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:35:37,929 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:35:37,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37 WrapperNode [2018-01-23 14:35:37,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:35:37,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:35:37,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:35:37,936 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:35:37,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (1/1) ... [2018-01-23 14:35:37,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:35:37,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:35:37,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:35:37,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:35:37,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (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:35:38,018 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:35:38,018 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:35:38,018 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-23 14:35:38,018 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:35:38,019 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:35:38,019 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:35:38,019 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:35:38,019 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:35:38,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:35:38,019 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:35:38,020 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:35:38,020 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:35:38,020 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:35:38,020 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:35:38,020 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:35:38,020 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-23 14:35:38,021 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:35:38,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:35:38,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:35:38,233 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:35:38,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:35:38 BoogieIcfgContainer [2018-01-23 14:35:38,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:35:38,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:35:38,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:35:38,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:35:38,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:35:37" (1/3) ... [2018-01-23 14:35:38,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610602ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:35:38, skipping insertion in model container [2018-01-23 14:35:38,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:35:37" (2/3) ... [2018-01-23 14:35:38,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610602ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:35:38, skipping insertion in model container [2018-01-23 14:35:38,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:35:38" (3/3) ... [2018-01-23 14:35:38,239 INFO L105 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i [2018-01-23 14:35:38,245 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:35:38,251 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:35:38,290 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:35:38,290 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:35:38,290 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:35:38,290 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:35:38,291 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:35:38,291 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:35:38,291 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:35:38,291 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-23 14:35:38,292 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:35:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:35:38,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:35:38,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 49 states. [2018-01-23 14:35:38,414 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 526) no Hoare annotation was computed. [2018-01-23 14:35:38,415 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 620 622) no Hoare annotation was computed. [2018-01-23 14:35:38,415 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 620 622) the Hoare annotation is: true [2018-01-23 14:35:38,415 INFO L401 ceAbstractionStarter]: For program point L621(line 621) no Hoare annotation was computed. [2018-01-23 14:35:38,415 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 620 622) no Hoare annotation was computed. [2018-01-23 14:35:38,416 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 659) no Hoare annotation was computed. [2018-01-23 14:35:38,416 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 659) no Hoare annotation was computed. [2018-01-23 14:35:38,416 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 659) the Hoare annotation is: true [2018-01-23 14:35:38,416 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 659) no Hoare annotation was computed. [2018-01-23 14:35:38,416 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 659) the Hoare annotation is: true [2018-01-23 14:35:38,416 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 659) no Hoare annotation was computed. [2018-01-23 14:35:38,416 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 659) the Hoare annotation is: true [2018-01-23 14:35:38,417 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 659) no Hoare annotation was computed. [2018-01-23 14:35:38,417 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 659) no Hoare annotation was computed. [2018-01-23 14:35:38,417 INFO L401 ceAbstractionStarter]: For program point L645'''(lines 645 651) no Hoare annotation was computed. [2018-01-23 14:35:38,417 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:35:38,417 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-23 14:35:38,417 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-23 14:35:38,417 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 627 659) no Hoare annotation was computed. [2018-01-23 14:35:38,418 INFO L401 ceAbstractionStarter]: For program point L655(line 655) no Hoare annotation was computed. [2018-01-23 14:35:38,418 INFO L401 ceAbstractionStarter]: For program point L654(line 654) no Hoare annotation was computed. [2018-01-23 14:35:38,418 INFO L404 ceAbstractionStarter]: At program point L653''(lines 653 657) the Hoare annotation is: true [2018-01-23 14:35:38,418 INFO L401 ceAbstractionStarter]: For program point L653(lines 653 657) no Hoare annotation was computed. [2018-01-23 14:35:38,418 INFO L401 ceAbstractionStarter]: For program point L629'''(line 629) no Hoare annotation was computed. [2018-01-23 14:35:38,418 INFO L401 ceAbstractionStarter]: For program point L646'''(lines 646 648) no Hoare annotation was computed. [2018-01-23 14:35:38,418 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 627 659) no Hoare annotation was computed. [2018-01-23 14:35:38,419 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 627 659) the Hoare annotation is: true [2018-01-23 14:35:38,419 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 640) the Hoare annotation is: true [2018-01-23 14:35:38,419 INFO L404 ceAbstractionStarter]: At program point L636'(line 636) the Hoare annotation is: true [2018-01-23 14:35:38,419 INFO L401 ceAbstractionStarter]: For program point L636'''(line 636) no Hoare annotation was computed. [2018-01-23 14:35:38,419 INFO L401 ceAbstractionStarter]: For program point L653'''(lines 653 657) no Hoare annotation was computed. [2018-01-23 14:35:38,419 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-23 14:35:38,419 INFO L401 ceAbstractionStarter]: For program point L645(lines 645 651) no Hoare annotation was computed. [2018-01-23 14:35:38,420 INFO L404 ceAbstractionStarter]: At program point L645''(lines 645 651) the Hoare annotation is: true [2018-01-23 14:35:38,420 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-23 14:35:38,420 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-23 14:35:38,420 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:35:38,420 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-23 14:35:38,420 INFO L401 ceAbstractionStarter]: For program point L633''''''(lines 633 640) no Hoare annotation was computed. [2018-01-23 14:35:38,420 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-23 14:35:38,421 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-23 14:35:38,421 INFO L404 ceAbstractionStarter]: At program point L629'(line 629) the Hoare annotation is: true [2018-01-23 14:35:38,421 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 627 659) no Hoare annotation was computed. [2018-01-23 14:35:38,421 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-23 14:35:38,421 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 640) no Hoare annotation was computed. [2018-01-23 14:35:38,421 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:35:38,421 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-23 14:35:38,422 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-23 14:35:38,422 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-23 14:35:38,422 INFO L401 ceAbstractionStarter]: For program point L646'(line 646) no Hoare annotation was computed. [2018-01-23 14:35:38,422 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-23 14:35:38,422 INFO L401 ceAbstractionStarter]: For program point L654'(line 654) no Hoare annotation was computed. [2018-01-23 14:35:38,426 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:35:38,427 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:35:38,427 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:35:38,427 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:35:38,427 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:35:38,427 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:35:38,427 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:35:38,427 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:35:38,427 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:35:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:35:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:35:38,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:38,431 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:35:38,431 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:35:38,437 INFO L82 PathProgramCache]: Analyzing trace with hash 135692, now seen corresponding path program 1 times [2018-01-23 14:35:38,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:38,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:38,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:38,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:38,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:35:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:35:38,513 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:35:38,517 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:35:38,521 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:35:38,521 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:35:38,521 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:35:38,521 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:35:38,521 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:35:38,522 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:35:38,522 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:35:38,522 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:35:38,522 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:35:38,524 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:35:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-23 14:35:38,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:38,526 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] [2018-01-23 14:35:38,527 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:35:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1622057019, now seen corresponding path program 1 times [2018-01-23 14:35:38,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:38,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:38,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:38,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:38,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:38,554 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:38,590 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:35:38,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:35:38,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:35:38,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:35:38,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:35:38,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:35:38,668 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-23 14:35:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:38,683 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-01-23 14:35:38,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:35:38,684 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-23 14:35:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:38,690 INFO L225 Difference]: With dead ends: 73 [2018-01-23 14:35:38,691 INFO L226 Difference]: Without dead ends: 41 [2018-01-23 14:35:38,693 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:35:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-23 14:35:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-23 14:35:38,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-23 14:35:38,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-23 14:35:38,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-23 14:35:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:38,723 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-23 14:35:38,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:35:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-23 14:35:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-23 14:35:38,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:38,724 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:35:38,724 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:35:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1506847670, now seen corresponding path program 1 times [2018-01-23 14:35:38,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:38,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:38,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:38,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:38,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:38,750 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:38,859 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:35:38,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:35:38,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:35:38,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:35:38,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:35:38,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:35:38,900 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2018-01-23 14:35:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:39,036 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-01-23 14:35:39,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:35:39,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-23 14:35:39,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:39,038 INFO L225 Difference]: With dead ends: 79 [2018-01-23 14:35:39,038 INFO L226 Difference]: Without dead ends: 67 [2018-01-23 14:35:39,039 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:35:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-23 14:35:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2018-01-23 14:35:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-23 14:35:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-23 14:35:39,047 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 25 [2018-01-23 14:35:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:39,047 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-23 14:35:39,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:35:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-23 14:35:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:35:39,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:39,049 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] [2018-01-23 14:35:39,049 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:35:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1533825156, now seen corresponding path program 1 times [2018-01-23 14:35:39,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:39,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:39,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:39,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:35:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:35:39,116 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:35:39,124 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:35:39,131 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:35:39,131 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:35:39,146 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:35:39,146 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:35:39,146 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:35:39,146 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:35:39,146 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:35:39,146 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:35:39,146 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:35:39,147 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:35:39,147 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:35:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-23 14:35:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-23 14:35:39,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:39,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:35:39,150 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash 220682052, now seen corresponding path program 1 times [2018-01-23 14:35:39,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:39,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:39,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:39,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:39,157 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:39,167 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:35:39,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:35:39,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:35:39,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:35:39,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:35:39,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:35:39,168 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-23 14:35:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:39,173 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-01-23 14:35:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:35:39,173 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-23 14:35:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:39,174 INFO L225 Difference]: With dead ends: 73 [2018-01-23 14:35:39,174 INFO L226 Difference]: Without dead ends: 39 [2018-01-23 14:35:39,175 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:35:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-23 14:35:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-23 14:35:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-23 14:35:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-23 14:35:39,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-01-23 14:35:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:39,180 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-23 14:35:39,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:35:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-23 14:35:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-23 14:35:39,181 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:39,181 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] [2018-01-23 14:35:39,181 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1544798995, now seen corresponding path program 1 times [2018-01-23 14:35:39,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:39,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:39,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:39,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:39,196 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:39,233 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:35:39,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:35:39,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-23 14:35:39,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:35:39,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:35:39,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:35:39,235 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-23 14:35:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:39,315 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-01-23 14:35:39,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:35:39,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-23 14:35:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:39,316 INFO L225 Difference]: With dead ends: 75 [2018-01-23 14:35:39,316 INFO L226 Difference]: Without dead ends: 65 [2018-01-23 14:35:39,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:35:39,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-23 14:35:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2018-01-23 14:35:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-23 14:35:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-23 14:35:39,321 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 23 [2018-01-23 14:35:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:39,322 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-23 14:35:39,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:35:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-23 14:35:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-23 14:35:39,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:39,323 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] [2018-01-23 14:35:39,323 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1056343501, now seen corresponding path program 1 times [2018-01-23 14:35:39,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:39,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:39,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:39,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:39,338 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:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:39,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:39,520 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:35:39,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:39,575 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:39,720 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~7.base Int)) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~p~7.base 0)) (not (= 0 main_~p~7.base)))) is different from true [2018-01-23 14:35:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-23 14:35:39,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:39,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-23 14:35:39,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-23 14:35:39,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-23 14:35:39,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2018-01-23 14:35:39,784 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 11 states. [2018-01-23 14:35:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:40,131 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-01-23 14:35:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:35:40,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-01-23 14:35:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:40,132 INFO L225 Difference]: With dead ends: 79 [2018-01-23 14:35:40,133 INFO L226 Difference]: Without dead ends: 76 [2018-01-23 14:35:40,133 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=159, Unknown=1, NotChecked=26, Total=240 [2018-01-23 14:35:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-23 14:35:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-01-23 14:35:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-23 14:35:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-23 14:35:40,142 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 35 [2018-01-23 14:35:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:40,143 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-23 14:35:40,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-23 14:35:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-23 14:35:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-23 14:35:40,144 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:40,145 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:35:40,145 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash -466630891, now seen corresponding path program 2 times [2018-01-23 14:35:40,146 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:40,146 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:40,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:40,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:40,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:40,164 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:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:40,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:40,453 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:35:40,472 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:35:40,487 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:40,496 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:40,498 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:40,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:40,594 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:35:40,608 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:35:40,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:40,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:40,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:40,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-23 14:35:40,644 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:35:40,646 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:35:40,647 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 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-23 14:35:40,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:40,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:40,651 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:40,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-01-23 14:35:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:40,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:40,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-01-23 14:35:40,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-23 14:35:40,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-23 14:35:40,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:35:40,712 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 15 states. [2018-01-23 14:35:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:41,064 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-01-23 14:35:41,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-23 14:35:41,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-01-23 14:35:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:41,066 INFO L225 Difference]: With dead ends: 98 [2018-01-23 14:35:41,066 INFO L226 Difference]: Without dead ends: 62 [2018-01-23 14:35:41,067 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2018-01-23 14:35:41,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-23 14:35:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2018-01-23 14:35:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-23 14:35:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-23 14:35:41,073 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2018-01-23 14:35:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:41,074 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-23 14:35:41,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-23 14:35:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-23 14:35:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-23 14:35:41,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:41,075 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] [2018-01-23 14:35:41,076 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1523339684, now seen corresponding path program 1 times [2018-01-23 14:35:41,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:41,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:41,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:41,077 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:41,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:41,099 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:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:41,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:41,375 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:35:41,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:41,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:41,408 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:41,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:35:41,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:41,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:41,445 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:35:41,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-23 14:35:41,497 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:41,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:35:41,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,508 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:41,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-23 14:35:41,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:41,564 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:35:41,566 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:41,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-01-23 14:35:41,584 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:35:41,586 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:41,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,595 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:41,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-23 14:35:41,656 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:35:41,658 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:41,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:41,667 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:41,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:35:41,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:41,675 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:35:41,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2018-01-23 14:35:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:41,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:41,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2018-01-23 14:35:41,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-23 14:35:41,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-23 14:35:41,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-01-23 14:35:41,757 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 27 states. [2018-01-23 14:35:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:42,863 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2018-01-23 14:35:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-23 14:35:42,863 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2018-01-23 14:35:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:42,864 INFO L225 Difference]: With dead ends: 134 [2018-01-23 14:35:42,864 INFO L226 Difference]: Without dead ends: 122 [2018-01-23 14:35:42,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=373, Invalid=1883, Unknown=0, NotChecked=0, Total=2256 [2018-01-23 14:35:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-23 14:35:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 82. [2018-01-23 14:35:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-23 14:35:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-23 14:35:42,876 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 46 [2018-01-23 14:35:42,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:42,876 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-23 14:35:42,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-23 14:35:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-23 14:35:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-23 14:35:42,877 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:42,878 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:35:42,878 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:42,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1277921645, now seen corresponding path program 2 times [2018-01-23 14:35:42,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:42,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:42,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:42,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:42,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:42,906 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:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:43,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:43,353 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:35:43,360 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:35:43,373 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:43,383 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:43,386 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:43,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:43,402 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:43,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:35:43,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,424 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:43,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-23 14:35:43,587 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:43,589 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:43,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,600 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:43,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-01-23 14:35:43,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,685 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:43,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-23 14:35:43,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,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:43,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2018-01-23 14:35:43,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,710 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,711 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:43,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2018-01-23 14:35:43,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,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:35:43,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:35:43,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,778 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:43,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:51 [2018-01-23 14:35:43,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:43,905 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:43,908 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:43,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,925 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:43,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:65 [2018-01-23 14:35:43,965 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:43,974 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:43,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:43,989 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:43,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:71 [2018-01-23 14:35:44,083 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 75 treesize of output 50 [2018-01-23 14:35:44,100 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:44,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:44,123 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 18 treesize of output 9 [2018-01-23 14:35:44,123 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:44,141 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:44,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:44,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:44,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:44,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:4 [2018-01-23 14:35:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:44,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:44,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2018-01-23 14:35:44,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-23 14:35:44,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-23 14:35:44,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2018-01-23 14:35:44,190 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 33 states. [2018-01-23 14:35:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:46,167 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-01-23 14:35:46,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-23 14:35:46,167 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 57 [2018-01-23 14:35:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:46,168 INFO L225 Difference]: With dead ends: 169 [2018-01-23 14:35:46,168 INFO L226 Difference]: Without dead ends: 157 [2018-01-23 14:35:46,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=644, Invalid=3646, Unknown=0, NotChecked=0, Total=4290 [2018-01-23 14:35:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-23 14:35:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 88. [2018-01-23 14:35:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-23 14:35:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-23 14:35:46,179 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 57 [2018-01-23 14:35:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:46,179 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-23 14:35:46,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-23 14:35:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-23 14:35:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:35:46,180 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:46,181 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2018-01-23 14:35:46,181 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1740585822, now seen corresponding path program 3 times [2018-01-23 14:35:46,181 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:46,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:46,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:46,182 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:46,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:46,204 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:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:35:46,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:46,989 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:35:46,994 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:35:47,006 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:35:47,013 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:35:47,023 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:35:47,026 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:47,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:47,148 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:47,150 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:47,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,162 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:47,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:44 [2018-01-23 14:35:47,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:47,265 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 54 treesize of output 55 [2018-01-23 14:35:47,267 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:47,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:47 [2018-01-23 14:35:47,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:47,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2018-01-23 14:35:47,289 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:47,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,302 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:47,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:53 [2018-01-23 14:35:47,452 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:47,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-23 14:35:47,458 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 41 treesize of output 22 [2018-01-23 14:35:47,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-23 14:35:47,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:47,474 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:47,474 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:30 [2018-01-23 14:35:47,546 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~7.base 1))) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= 0 (select .cse0 c_main_~t~7.base)) (= |c_#valid| (store (store .cse0 c_main_~t~7.base 1) main_~p~7.base 0)) (not (= 0 main_~p~7.base))))) is different from true [2018-01-23 14:35:47,549 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_2 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_2 1))) (and (not (= 0 v_subst_2)) (= (store (store .cse0 c_main_~p~7.base 1) v_subst_2 0) |c_#valid|) (= 0 (select .cse0 c_main_~p~7.base)) (= (select |c_old(#valid)| v_subst_2) 0)))) is different from true [2018-01-23 14:35:47,553 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_subst_2 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_2 1))) (and (not (= 0 v_subst_2)) (= (store (store .cse1 c_main_~p~7.base 1) v_subst_2 0) |c_#valid|) (= 0 (select .cse1 c_main_~p~7.base)) (= (select |c_old(#valid)| v_subst_2) 0)))))) (or (and (not (= c_main_~p~7.offset 0)) .cse0) (and (not (= 0 c_main_~p~7.base)) .cse0))) is different from true [2018-01-23 14:35:47,662 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_5 1))) (and (= 0 (select .cse0 main_~p~7.base)) (not (= 0 v_prenex_5)) (= (select |c_old(#valid)| v_prenex_5) 0) (= |c_#valid| (store (store (store .cse0 main_~p~7.base 1) v_prenex_5 0) main_~p~7.base 0)) (not (= 0 main_~p~7.base))))) is different from true [2018-01-23 14:35:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2018-01-23 14:35:47,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:47,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-23 14:35:47,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-23 14:35:47,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-23 14:35:47,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1019, Unknown=22, NotChecked=268, Total=1406 [2018-01-23 14:35:47,705 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 38 states. [2018-01-23 14:35:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:49,496 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-23 14:35:49,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-23 14:35:49,496 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2018-01-23 14:35:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:49,497 INFO L225 Difference]: With dead ends: 104 [2018-01-23 14:35:49,497 INFO L226 Difference]: Without dead ends: 101 [2018-01-23 14:35:49,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=291, Invalid=2670, Unknown=25, NotChecked=436, Total=3422 [2018-01-23 14:35:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-23 14:35:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-01-23 14:35:49,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-23 14:35:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-01-23 14:35:49,507 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 58 [2018-01-23 14:35:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:49,508 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-01-23 14:35:49,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-23 14:35:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-01-23 14:35:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-23 14:35:49,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:49,509 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2018-01-23 14:35:49,509 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1556062687, now seen corresponding path program 4 times [2018-01-23 14:35:49,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:49,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:49,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:49,511 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:49,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:49,535 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:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:35:50,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:50,287 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:35:50,299 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:35:50,324 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:50,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:50,464 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 27 treesize of output 25 [2018-01-23 14:35:50,466 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:50,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:50,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:50,479 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 18 treesize of output 14 [2018-01-23 14:35:50,485 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 14 treesize of output 15 [2018-01-23 14:35:50,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-23 14:35:50,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:50,498 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 27 treesize of output 23 [2018-01-23 14:35:50,505 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 14 treesize of output 15 [2018-01-23 14:35:50,506 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-23 14:35:50,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:50,518 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:35:50,519 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:50,520 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:50,521 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:50,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:35:50,524 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:55, output treesize:15 [2018-01-23 14:35:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:35:50,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:50,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 33 [2018-01-23 14:35:50,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-23 14:35:50,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-23 14:35:50,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-23 14:35:50,638 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 33 states. [2018-01-23 14:35:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:53,289 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2018-01-23 14:35:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-23 14:35:53,289 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-01-23 14:35:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:53,290 INFO L225 Difference]: With dead ends: 195 [2018-01-23 14:35:53,290 INFO L226 Difference]: Without dead ends: 183 [2018-01-23 14:35:53,291 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1076, Invalid=5244, Unknown=0, NotChecked=0, Total=6320 [2018-01-23 14:35:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-23 14:35:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 114. [2018-01-23 14:35:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-23 14:35:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-23 14:35:53,305 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 63 [2018-01-23 14:35:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:53,305 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-23 14:35:53,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-23 14:35:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-23 14:35:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-23 14:35:53,306 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:53,306 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-01-23 14:35:53,306 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:53,306 INFO L82 PathProgramCache]: Analyzing trace with hash 356797414, now seen corresponding path program 5 times [2018-01-23 14:35:53,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:53,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:53,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:53,307 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:53,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:53,325 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:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:35:53,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:53,954 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:35:53,959 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-23 14:35:53,967 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:53,970 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:53,976 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:53,983 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:35:53,985 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:53,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:54,150 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 27 [2018-01-23 14:35:54,151 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 27 treesize of output 15 [2018-01-23 14:35:54,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:54,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:54,156 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:54,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:25 [2018-01-23 14:35:54,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-01-23 14:35:54,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-01-23 14:35:54,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:54,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:35:54,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:54,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:54,314 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:54,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2018-01-23 14:35:54,393 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:35:54,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:54,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17] total 40 [2018-01-23 14:35:54,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-23 14:35:54,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-23 14:35:54,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2018-01-23 14:35:54,414 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 40 states. [2018-01-23 14:35:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:56,900 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-01-23 14:35:56,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-23 14:35:56,900 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 64 [2018-01-23 14:35:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:56,901 INFO L225 Difference]: With dead ends: 208 [2018-01-23 14:35:56,901 INFO L226 Difference]: Without dead ends: 178 [2018-01-23 14:35:56,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=673, Invalid=6637, Unknown=0, NotChecked=0, Total=7310 [2018-01-23 14:35:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-23 14:35:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 149. [2018-01-23 14:35:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-23 14:35:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2018-01-23 14:35:56,928 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 64 [2018-01-23 14:35:56,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:56,928 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2018-01-23 14:35:56,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-23 14:35:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2018-01-23 14:35:56,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-23 14:35:56,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:56,930 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-23 14:35:56,930 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:56,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1770948968, now seen corresponding path program 6 times [2018-01-23 14:35:56,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:56,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:56,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:56,931 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:56,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:56,952 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:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-23 14:35:57,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:57,374 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:35:57,380 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-23 14:35:57,394 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:35:57,403 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:35:57,411 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:35:57,425 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-23 14:35:57,429 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:35:57,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:35:57,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 6 treesize of output 5 [2018-01-23 14:35:57,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:35:57,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:57,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:57,465 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:35:57,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-23 14:35:57,499 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:57,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, 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:57,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,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:57,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, 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:57,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,527 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:57,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-01-23 14:35:57,537 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:57,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-23 14:35:57,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-01-23 14:35:57,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:35:57,598 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 31 treesize of output 32 [2018-01-23 14:35:57,600 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:57,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-01-23 14:35:57,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-23 14:35:57,616 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:57,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2018-01-23 14:35:57,782 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-01-23 14:35:57,784 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 6 treesize of output 4 [2018-01-23 14:35:57,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:35:57,791 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:35:57,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:35:57,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:57,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:35:57,796 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-01-23 14:35:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-23 14:35:57,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:35:57,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 29 [2018-01-23 14:35:57,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-23 14:35:57,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-23 14:35:57,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-01-23 14:35:57,935 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand 29 states. [2018-01-23 14:35:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:35:58,767 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-01-23 14:35:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-23 14:35:58,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-01-23 14:35:58,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:35:58,768 INFO L225 Difference]: With dead ends: 166 [2018-01-23 14:35:58,768 INFO L226 Difference]: Without dead ends: 119 [2018-01-23 14:35:58,769 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2018-01-23 14:35:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-23 14:35:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-23 14:35:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-23 14:35:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-23 14:35:58,782 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 70 [2018-01-23 14:35:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:35:58,782 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-23 14:35:58,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-23 14:35:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-23 14:35:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-23 14:35:58,783 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:35:58,783 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-01-23 14:35:58,783 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:35:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash -9630951, now seen corresponding path program 7 times [2018-01-23 14:35:58,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:35:58,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:35:58,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:58,785 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:35:58,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:35:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:58,808 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:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-23 14:35:59,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:35:59,698 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:59,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:35:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:35:59,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:00,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2018-01-23 14:36:00,201 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:00,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 46 [2018-01-23 14:36:00,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:36:00,227 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:00,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-01-23 14:36:00,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-01-23 14:36:00,246 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-23 14:36:00,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:00,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2018-01-23 14:36:00,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:00,294 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 23 treesize of output 15 [2018-01-23 14:36:00,294 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,314 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 1 case distinctions, treesize of input 25 treesize of output 29 [2018-01-23 14:36:00,319 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 21 treesize of output 15 [2018-01-23 14:36:00,320 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:00,331 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 25 treesize of output 18 [2018-01-23 14:36:00,331 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,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, 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 9 [2018-01-23 14:36:00,341 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,348 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:00,351 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 29 treesize of output 25 [2018-01-23 14:36:00,352 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 9 treesize of output 1 [2018-01-23 14:36:00,352 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,356 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:36:00,357 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,359 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2018-01-23 14:36:00,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-01-23 14:36:00,385 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,399 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:00,399 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:00,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-01-23 14:36:00,401 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,418 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 37 treesize of output 26 [2018-01-23 14:36:00,419 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,427 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:00,448 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-01-23 14:36:00,449 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:36:00,449 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,452 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 6 treesize of output 4 [2018-01-23 14:36:00,453 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,453 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2018-01-23 14:36:00,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, 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 11 [2018-01-23 14:36:00,460 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,469 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:00,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:00,476 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:105, output treesize:9 [2018-01-23 14:36:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:36:00,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:00,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18] total 44 [2018-01-23 14:36:00,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-01-23 14:36:00,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-01-23 14:36:00,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1759, Unknown=2, NotChecked=0, Total=1892 [2018-01-23 14:36:00,596 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 44 states. [2018-01-23 14:36:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:05,410 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2018-01-23 14:36:05,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-23 14:36:05,410 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 75 [2018-01-23 14:36:05,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:05,411 INFO L225 Difference]: With dead ends: 187 [2018-01-23 14:36:05,411 INFO L226 Difference]: Without dead ends: 184 [2018-01-23 14:36:05,414 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1467, Invalid=10735, Unknown=8, NotChecked=0, Total=12210 [2018-01-23 14:36:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-23 14:36:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 125. [2018-01-23 14:36:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-23 14:36:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-01-23 14:36:05,427 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 75 [2018-01-23 14:36:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:05,428 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-01-23 14:36:05,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-01-23 14:36:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-01-23 14:36:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:36:05,429 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:05,429 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:36:05,429 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash -728751170, now seen corresponding path program 8 times [2018-01-23 14:36:05,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:05,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:05,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:05,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:36:05,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:05,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-23 14:36:06,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:06,718 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:36:06,723 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:36:06,735 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:06,748 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:36:06,756 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:06,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:06,762 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:36:06,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-23 14:36:06,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:06,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:06,798 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:36:06,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-23 14:36:06,872 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:36:06,873 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:36:06,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,886 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:36:06,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:36:06,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,897 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:36:06,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-23 14:36:06,936 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 19 treesize of output 15 [2018-01-23 14:36:06,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:36:06,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:06,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-01-23 14:36:07,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,016 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 46 treesize of output 47 [2018-01-23 14:36:07,018 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:36:07,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:42 [2018-01-23 14:36:07,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 58 [2018-01-23 14:36:07,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:64 [2018-01-23 14:36:07,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,175 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 54 treesize of output 66 [2018-01-23 14:36:07,177 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 22 treesize of output 18 [2018-01-23 14:36:07,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,195 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:36:07,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:79 [2018-01-23 14:36:07,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,334 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 103 treesize of output 111 [2018-01-23 14:36:07,336 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:36:07,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:96 [2018-01-23 14:36:07,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,362 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 37 treesize of output 73 [2018-01-23 14:36:07,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:93 [2018-01-23 14:36:07,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,455 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,460 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 99 treesize of output 107 [2018-01-23 14:36:07,464 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:36:07,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,486 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:36:07,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:111 [2018-01-23 14:36:07,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,637 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,642 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 148 [2018-01-23 14:36:07,652 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:36:07,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,678 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:36:07,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:162, output treesize:131 [2018-01-23 14:36:07,731 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:07,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 124 [2018-01-23 14:36:07,744 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 26 treesize of output 25 [2018-01-23 14:36:07,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:07,801 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:36:07,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:173, output treesize:153 [2018-01-23 14:36:08,169 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 7 treesize of output 5 [2018-01-23 14:36:08,173 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:36:08,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:08,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:08,212 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:36:08,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:137 [2018-01-23 14:36:08,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:08,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:08,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 90 [2018-01-23 14:36:08,462 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 57 [2018-01-23 14:36:08,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-01-23 14:36:08,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:36:08,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:08,502 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 39 treesize of output 33 [2018-01-23 14:36:08,502 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:08,512 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 23 treesize of output 19 [2018-01-23 14:36:08,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:08,520 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:36:08,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:08,521 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:36:08,522 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:08,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-23 14:36:08,530 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:36:08,531 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:143, output treesize:11 [2018-01-23 14:36:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:36:08,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:08,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 56 [2018-01-23 14:36:08,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-23 14:36:08,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-23 14:36:08,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2908, Unknown=0, NotChecked=0, Total=3080 [2018-01-23 14:36:08,726 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 56 states. [2018-01-23 14:36:09,905 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 126 DAG size of output 78 [2018-01-23 14:36:11,055 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 126 DAG size of output 99 [2018-01-23 14:36:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:15,635 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2018-01-23 14:36:15,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-23 14:36:15,635 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 80 [2018-01-23 14:36:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:15,637 INFO L225 Difference]: With dead ends: 278 [2018-01-23 14:36:15,637 INFO L226 Difference]: Without dead ends: 260 [2018-01-23 14:36:15,641 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3854 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1314, Invalid=13206, Unknown=0, NotChecked=0, Total=14520 [2018-01-23 14:36:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-01-23 14:36:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 147. [2018-01-23 14:36:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-23 14:36:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-01-23 14:36:15,662 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 80 [2018-01-23 14:36:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:15,663 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-01-23 14:36:15,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-01-23 14:36:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-01-23 14:36:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-23 14:36:15,663 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:15,663 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-23 14:36:15,664 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1162355553, now seen corresponding path program 9 times [2018-01-23 14:36:15,664 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:15,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:15,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:15,664 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:36:15,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:15,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-23 14:36:18,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:18,017 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:36:18,022 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-23 14:36:18,034 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:36:18,041 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:36:18,053 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:36:18,071 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-23 14:36:18,074 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:18,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:18,248 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:36:18,250 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:36:18,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,263 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:36:18,265 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:36:18,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,277 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:36:18,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:53 [2018-01-23 14:36:18,327 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 19 treesize of output 15 [2018-01-23 14:36:18,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-23 14:36:18,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:50 [2018-01-23 14:36:18,425 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,428 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 54 treesize of output 55 [2018-01-23 14:36:18,430 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:36:18,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:50 [2018-01-23 14:36:18,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 84 [2018-01-23 14:36:18,565 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 22 treesize of output 18 [2018-01-23 14:36:18,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,595 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 16 [2018-01-23 14:36:18,598 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:36:18,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,615 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:36:18,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:97 [2018-01-23 14:36:18,687 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 27 treesize of output 11 [2018-01-23 14:36:18,689 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:36:18,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:117, output treesize:94 [2018-01-23 14:36:18,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,853 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 98 treesize of output 118 [2018-01-23 14:36:18,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:36:18,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:109, output treesize:94 [2018-01-23 14:36:18,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:18,892 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 101 treesize of output 122 [2018-01-23 14:36:18,895 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:36:18,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:18,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:109, output treesize:95 [2018-01-23 14:36:19,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:19,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:19,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:19,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:19,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 114 [2018-01-23 14:36:19,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:19,708 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 75 [2018-01-23 14:36:19,711 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-23 14:36:19,799 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 58 treesize of output 53 [2018-01-23 14:36:19,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:19,802 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 52 treesize of output 41 [2018-01-23 14:36:19,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:19,805 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 0 case distinctions, treesize of input 62 treesize of output 49 [2018-01-23 14:36:19,806 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:19,816 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 64 treesize of output 59 [2018-01-23 14:36:19,817 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:19,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-23 14:36:20,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:20,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:20,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:20,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:20,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-23 14:36:20,013 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 104 [2018-01-23 14:36:20,021 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-01-23 14:36:20,021 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:20,047 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2018-01-23 14:36:20,048 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:36:20,073 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 46 treesize of output 35 [2018-01-23 14:36:20,073 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:20,075 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 52 treesize of output 41 [2018-01-23 14:36:20,075 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:20,094 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-23 14:36:20,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-01-23 14:36:20,200 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:215, output treesize:303 [2018-01-23 14:36:20,469 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= 0 c_main_~p~7.base)) (exists ((v_prenex_27 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse1 (store .cse0 c_main_~p~7.base 1))) (and (= (select .cse0 c_main_~p~7.base) 0) (= (store (store .cse1 c_main_~t~7.base 1) v_prenex_27 0) |c_#valid|) (= 0 (select .cse1 c_main_~t~7.base)) (= (select |c_old(#valid)| v_prenex_27) 0) (not (= 0 v_prenex_27))))))) (and (exists ((v_prenex_35 Int) (v_arrayElimCell_89 Int)) (let ((.cse3 (store |c_old(#valid)| v_prenex_35 1))) (let ((.cse2 (store .cse3 c_main_~p~7.base 1))) (and (not (= 0 v_prenex_35)) (= (select |c_old(#valid)| v_prenex_35) 0) (= (store (store .cse2 v_arrayElimCell_89 1) v_prenex_35 0) |c_#valid|) (= 0 (select .cse3 c_main_~p~7.base)) (= (select .cse2 v_arrayElimCell_89) 0))))) (not (= c_main_~p~7.offset 0)))) is different from true [2018-01-23 14:36:20,477 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_27 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse1 (store .cse0 main_~p~7.base 1))) (and (= (select .cse0 main_~p~7.base) 0) (= 0 (select .cse1 c_main_~t~7.base)) (= (select |c_old(#valid)| v_prenex_27) 0) (= |c_#valid| (store (store (store .cse1 c_main_~t~7.base 1) v_prenex_27 0) main_~p~7.base 0)) (not (= 0 main_~p~7.base)) (not (= 0 v_prenex_27)))))) is different from true [2018-01-23 14:36:20,480 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_27 Int) (v_subst_9 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse1 (store .cse0 v_subst_9 1))) (and (not (= 0 v_subst_9)) (= (select |c_old(#valid)| v_prenex_27) 0) (= (select .cse0 v_subst_9) 0) (= (select .cse1 c_main_~p~7.base) 0) (not (= 0 v_prenex_27)) (= |c_#valid| (store (store (store .cse1 c_main_~p~7.base 1) v_prenex_27 0) v_subst_9 0)))))) is different from true [2018-01-23 14:36:20,492 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_prenex_27 Int) (v_subst_9 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse2 (store .cse1 v_subst_9 1))) (and (not (= 0 v_subst_9)) (= (select |c_old(#valid)| v_prenex_27) 0) (= (select .cse1 v_subst_9) 0) (= (select .cse2 c_main_~p~7.base) 0) (not (= 0 v_prenex_27)) (= |c_#valid| (store (store (store .cse2 c_main_~p~7.base 1) v_prenex_27 0) v_subst_9 0)))))))) (or (and (not (= c_main_~p~7.offset 0)) .cse0) (and .cse0 (not (= 0 c_main_~p~7.base))))) is different from true [2018-01-23 14:36:20,502 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= 0 c_main_~p~7.base)) (exists ((v_prenex_37 Int) (v_prenex_36 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_36 1))) (let ((.cse0 (store .cse1 v_prenex_37 1))) (and (not (= 0 v_prenex_37)) (= (select .cse0 c_main_~p~7.base) 0) (= (select .cse1 v_prenex_37) 0) (= |c_#valid| (store (store (store .cse0 c_main_~p~7.base 1) v_prenex_36 0) v_prenex_37 0)) (not (= 0 v_prenex_36)) (= (select |c_old(#valid)| v_prenex_36) 0)))))) (and (not (= c_main_~p~7.offset 0)) (exists ((v_prenex_27 Int) (v_subst_9 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_27 1))) (let ((.cse3 (store .cse2 v_subst_9 1))) (and (not (= 0 v_subst_9)) (= (select |c_old(#valid)| v_prenex_27) 0) (= (select .cse2 v_subst_9) 0) (= (select .cse3 c_main_~p~7.base) 0) (not (= 0 v_prenex_27)) (= |c_#valid| (store (store (store .cse3 c_main_~p~7.base 1) v_prenex_27 0) v_subst_9 0)))))))) is different from true [2018-01-23 14:36:20,509 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_37 Int) (v_prenex_36 Int) (main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_36 1))) (let ((.cse0 (store .cse1 v_prenex_37 1))) (and (not (= 0 v_prenex_37)) (= (store (store (store (store .cse0 main_~p~7.base 1) v_prenex_36 0) v_prenex_37 0) main_~p~7.base 0) |c_#valid|) (= (select .cse0 main_~p~7.base) 0) (= (select .cse1 v_prenex_37) 0) (not (= 0 v_prenex_36)) (not (= 0 main_~p~7.base)) (= (select |c_old(#valid)| v_prenex_36) 0))))) is different from true [2018-01-23 14:36:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 20 not checked. [2018-01-23 14:36:20,585 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:20,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 59 [2018-01-23 14:36:20,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-23 14:36:20,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-23 14:36:20,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2708, Unknown=14, NotChecked=654, Total=3540 [2018-01-23 14:36:20,587 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 60 states. [2018-01-23 14:36:23,685 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 118 DAG size of output 95 [2018-01-23 14:36:23,939 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 107 DAG size of output 75 [2018-01-23 14:36:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:36:25,073 INFO L93 Difference]: Finished difference Result 197 states and 210 transitions. [2018-01-23 14:36:25,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-23 14:36:25,073 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 81 [2018-01-23 14:36:25,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:36:25,074 INFO L225 Difference]: With dead ends: 197 [2018-01-23 14:36:25,074 INFO L226 Difference]: Without dead ends: 194 [2018-01-23 14:36:25,075 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 87 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=425, Invalid=6389, Unknown=16, NotChecked=1002, Total=7832 [2018-01-23 14:36:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-23 14:36:25,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2018-01-23 14:36:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-23 14:36:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2018-01-23 14:36:25,097 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 81 [2018-01-23 14:36:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:36:25,098 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2018-01-23 14:36:25,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-23 14:36:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2018-01-23 14:36:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-23 14:36:25,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:36:25,099 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-01-23 14:36:25,099 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:36:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash -248388183, now seen corresponding path program 10 times [2018-01-23 14:36:25,100 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:36:25,100 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:36:25,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:25,101 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:36:25,101 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:36:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:36:25,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:36:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:36:26,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:36:26,302 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:36:26,307 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-23 14:36:26,333 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:36:26,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:36:26,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2018-01-23 14:36:26,940 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 48 treesize of output 39 [2018-01-23 14:36:26,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,951 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:26,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 30 [2018-01-23 14:36:26,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:26,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-01-23 14:36:26,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:26,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-23 14:36:26,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-23 14:36:26,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:117 [2018-01-23 14:36:27,420 WARN L143 SmtUtils]: Spent 344ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-23 14:36:27,635 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-23 14:36:27,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2018-01-23 14:36:27,827 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 38 treesize of output 34 [2018-01-23 14:36:27,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,854 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 24 treesize of output 22 [2018-01-23 14:36:27,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,879 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 32 treesize of output 30 [2018-01-23 14:36:27,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,903 INFO L682 Elim1Store]: detected equality via solver [2018-01-23 14:36:27,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-23 14:36:27,904 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,919 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 18 treesize of output 7 [2018-01-23 14:36:27,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 47 [2018-01-23 14:36:27,950 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 29 treesize of output 27 [2018-01-23 14:36:27,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,973 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 21 treesize of output 18 [2018-01-23 14:36:27,974 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-23 14:36:27,989 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 35 treesize of output 24 [2018-01-23 14:36:27,989 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:27,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-23 14:36:27,999 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,021 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 10 treesize of output 8 [2018-01-23 14:36:28,022 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,025 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:36:28,028 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:36:28,028 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:82, output treesize:3 [2018-01-23 14:36:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 57 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-23 14:36:28,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:36:28,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 25] total 61 [2018-01-23 14:36:28,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-01-23 14:36:28,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-01-23 14:36:28,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3454, Unknown=0, NotChecked=0, Total=3660 [2018-01-23 14:36:28,173 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand 61 states. Received shutdown request... [2018-01-23 14:36:32,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-23 14:36:32,533 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:36:32,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:36:32 BoogieIcfgContainer [2018-01-23 14:36:32,534 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:36:32,535 INFO L168 Benchmark]: Toolchain (without parser) took 54817.35 ms. Allocated memory was 305.1 MB in the beginning and 818.4 MB in the end (delta: 513.3 MB). Free memory was 264.1 MB in the beginning and 704.9 MB in the end (delta: -440.9 MB). Peak memory consumption was 72.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:32,536 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:36:32,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.97 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 254.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:32,536 INFO L168 Benchmark]: Boogie Preprocessor took 33.57 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:32,536 INFO L168 Benchmark]: RCFGBuilder took 264.42 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 231.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:32,537 INFO L168 Benchmark]: TraceAbstraction took 54299.77 ms. Allocated memory was 305.1 MB in the beginning and 818.4 MB in the end (delta: 513.3 MB). Free memory was 231.0 MB in the beginning and 704.9 MB in the end (delta: -473.9 MB). Peak memory consumption was 39.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:36:32,538 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.19 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.97 ms. Allocated memory is still 305.1 MB. Free memory was 264.1 MB in the beginning and 254.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.57 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 264.42 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 231.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54299.77 ms. Allocated memory was 305.1 MB in the beginning and 818.4 MB in the end (delta: 513.3 MB). Free memory was 231.0 MB in the beginning and 704.9 MB in the end (delta: -473.9 MB). Peak memory consumption was 39.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: 526]: 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, 52 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=49occurred 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, 10 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 10 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 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, 52 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=49occurred 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: [L628] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L629] COND FALSE !(a == 0) VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={13:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] FCALL p->h = i VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L642] FCALL p->n = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L643] p = a [L644] i = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L645] COND TRUE p!=0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L646] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=0] [L646] COND FALSE !(p->h != i) [L649] EXPR, FCALL p->n VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}] [L649] p = p->n [L650] i++ VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}] [L645] COND FALSE !(p!=0) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}] [L652] p = a VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}] [L653] COND TRUE p != 0 VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}] [L654] EXPR, FCALL p->n VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}] [L654] t = p->n [L655] FCALL free(p) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}, t={0:0}] [L656] p = t VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}, t={0:0}] [L653] COND FALSE !(p != 0) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}, t={0:0}] [L658] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 134 SDslu, 38 SDs, 0 SdLazy, 34 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 2 MinimizatonAttempts, 22 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (177states) and interpolant automaton (currently 29 states, 61 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 136. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. TIMEOUT Result, 53.3s OverallTime, 14 OverallIterations, 5 TraceHistogramMax, 32.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 506 SDtfs, 4517 SDslu, 8837 SDs, 0 SdLazy, 13903 SolverSat, 1434 SolverUnsat, 51 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1465 GetRequests, 596 SyntacticMatches, 53 SemanticMatches, 815 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 15469 ImplicationChecksByTransitivity, 34.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=13, 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, 13 MinimizatonAttempts, 451 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 1555 NumberOfCodeBlocks, 1543 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1529 ConstructedInterpolants, 140 QuantifiedInterpolants, 2722474 SizeOfPredicates, 244 NumberOfNonLiveVariables, 2444 ConjunctsInSsa, 636 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 270/928 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/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-36-32-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-36-32-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-36-32-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-36-32-544.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-36-32-544.csv Completed graceful shutdown