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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 01:00:35,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 01:00:35,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 01:00:35,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 01:00:35,506 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 01:00:35,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 01:00:35,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 01:00:35,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 01:00:35,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 01:00:35,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 01:00:35,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 01:00:35,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 01:00:35,515 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 01:00:35,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 01:00:35,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 01:00:35,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 01:00:35,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 01:00:35,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 01:00:35,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 01:00:35,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 01:00:35,530 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 01:00:35,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 01:00:35,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 01:00:35,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 01:00:35,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 01:00:35,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 01:00:35,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 01:00:35,535 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 01:00:35,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 01:00:35,535 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 01:00:35,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 01:00:35,536 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 01:00:35,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 01:00:35,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 01:00:35,546 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 01:00:35,546 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 01:00:35,546 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 01:00:35,546 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 01:00:35,546 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 01:00:35,546 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 01:00:35,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 01:00:35,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 01:00:35,547 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 01:00:35,547 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 01:00:35,548 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 01:00:35,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 01:00:35,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 01:00:35,549 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 01:00:35,549 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 01:00:35,549 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 01:00:35,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 01:00:35,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 01:00:35,550 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 01:00:35,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 01:00:35,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 01:00:35,550 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 01:00:35,550 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 01:00:35,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 01:00:35,551 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 01:00:35,551 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 01:00:35,551 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 01:00:35,552 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 01:00:35,552 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 01:00:35,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 01:00:35,596 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 01:00:35,599 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 01:00:35,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 01:00:35,601 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 01:00:35,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-01-21 01:00:35,765 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 01:00:35,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 01:00:35,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 01:00:35,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 01:00:35,777 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 01:00:35,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:35,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793dbc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35, skipping insertion in model container [2018-01-21 01:00:35,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:35,795 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:00:35,835 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 01:00:35,963 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:00:35,985 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 01:00:35,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35 WrapperNode [2018-01-21 01:00:35,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 01:00:35,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 01:00:35,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 01:00:35,995 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 01:00:36,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:36,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:36,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:36,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:36,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:36,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:36,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (1/1) ... [2018-01-21 01:00:36,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 01:00:36,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 01:00:36,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 01:00:36,035 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 01:00:36,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (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-21 01:00:36,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 01:00:36,090 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 01:00:36,091 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 01:00:36,091 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 01:00:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 01:00:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 01:00:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 01:00:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 01:00:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 01:00:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 01:00:36,091 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 01:00:36,092 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 01:00:36,092 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 01:00:36,092 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 01:00:36,092 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 01:00:36,092 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 01:00:36,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 01:00:36,093 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 01:00:36,325 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 01:00:36,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:00:36 BoogieIcfgContainer [2018-01-21 01:00:36,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 01:00:36,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 01:00:36,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 01:00:36,328 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 01:00:36,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 01:00:35" (1/3) ... [2018-01-21 01:00:36,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216833a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:00:36, skipping insertion in model container [2018-01-21 01:00:36,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 01:00:35" (2/3) ... [2018-01-21 01:00:36,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216833a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 01:00:36, skipping insertion in model container [2018-01-21 01:00:36,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 01:00:36" (3/3) ... [2018-01-21 01:00:36,332 INFO L105 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-01-21 01:00:36,338 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 01:00:36,347 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 01:00:36,397 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:36,397 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:36,397 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:36,398 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:36,398 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:36,398 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:36,398 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:36,398 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 01:00:36,399 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 01:00:36,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 01:00:36,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 57 states. [2018-01-21 01:00:36,528 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 01:00:36,528 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 01:00:36,528 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 01:00:36,529 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 01:00:36,529 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 01:00:36,529 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 654) no Hoare annotation was computed. [2018-01-21 01:00:36,529 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 654) no Hoare annotation was computed. [2018-01-21 01:00:36,529 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 654) the Hoare annotation is: true [2018-01-21 01:00:36,529 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 654) no Hoare annotation was computed. [2018-01-21 01:00:36,530 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 654) the Hoare annotation is: true [2018-01-21 01:00:36,530 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 654) no Hoare annotation was computed. [2018-01-21 01:00:36,530 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 654) the Hoare annotation is: true [2018-01-21 01:00:36,530 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 654) no Hoare annotation was computed. [2018-01-21 01:00:36,530 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 654) no Hoare annotation was computed. [2018-01-21 01:00:36,530 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-21 01:00:36,530 INFO L401 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point L649'''(lines 649 650) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point L638''''(lines 638 644) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point L651''(lines 651 652) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 654) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point L648'(line 648) no Hoare annotation was computed. [2018-01-21 01:00:36,531 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L649(lines 649 650) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L648(line 648) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L628'''(line 628) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point L647(lines 647 648) no Hoare annotation was computed. [2018-01-21 01:00:36,532 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 654) no Hoare annotation was computed. [2018-01-21 01:00:36,533 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 01:00:36,533 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-21 01:00:36,533 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-21 01:00:36,533 INFO L401 ceAbstractionStarter]: For program point L631(lines 631 637) no Hoare annotation was computed. [2018-01-21 01:00:36,533 INFO L401 ceAbstractionStarter]: For program point L638(lines 638 644) no Hoare annotation was computed. [2018-01-21 01:00:36,533 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-21 01:00:36,533 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-21 01:00:36,534 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-21 01:00:36,534 INFO L404 ceAbstractionStarter]: At program point L634'(line 634) the Hoare annotation is: true [2018-01-21 01:00:36,534 INFO L401 ceAbstractionStarter]: For program point L634'''(line 634) no Hoare annotation was computed. [2018-01-21 01:00:36,534 INFO L401 ceAbstractionStarter]: For program point L631'(lines 631 637) no Hoare annotation was computed. [2018-01-21 01:00:36,535 INFO L404 ceAbstractionStarter]: At program point L631'''(lines 631 637) the Hoare annotation is: true [2018-01-21 01:00:36,535 INFO L401 ceAbstractionStarter]: For program point L639'(line 639) no Hoare annotation was computed. [2018-01-21 01:00:36,535 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-21 01:00:36,535 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-21 01:00:36,535 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 01:00:36,535 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 654) no Hoare annotation was computed. [2018-01-21 01:00:36,535 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 654) the Hoare annotation is: true [2018-01-21 01:00:36,536 INFO L401 ceAbstractionStarter]: For program point L632'(line 632) no Hoare annotation was computed. [2018-01-21 01:00:36,536 INFO L404 ceAbstractionStarter]: At program point L628'(line 628) the Hoare annotation is: true [2018-01-21 01:00:36,536 INFO L404 ceAbstractionStarter]: At program point L647'''(lines 647 648) the Hoare annotation is: true [2018-01-21 01:00:36,536 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-21 01:00:36,536 INFO L404 ceAbstractionStarter]: At program point L641'(line 641) the Hoare annotation is: true [2018-01-21 01:00:36,536 INFO L401 ceAbstractionStarter]: For program point L638'(lines 638 644) no Hoare annotation was computed. [2018-01-21 01:00:36,536 INFO L401 ceAbstractionStarter]: For program point L638'''(lines 638 644) no Hoare annotation was computed. [2018-01-21 01:00:36,537 INFO L401 ceAbstractionStarter]: For program point L641'''(line 641) no Hoare annotation was computed. [2018-01-21 01:00:36,537 INFO L401 ceAbstractionStarter]: For program point L649''''(lines 649 650) no Hoare annotation was computed. [2018-01-21 01:00:36,541 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:36,541 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:36,541 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:36,541 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:36,542 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:36,542 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:36,542 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:36,542 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 01:00:36,542 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 01:00:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 01:00:36,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:36,546 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 01:00:36,547 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 01:00:36,550 INFO L82 PathProgramCache]: Analyzing trace with hash 154495, now seen corresponding path program 1 times [2018-01-21 01:00:36,553 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:36,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:36,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:36,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:36,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:36,621 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:00:36,626 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:00:36,632 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:36,632 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:36,632 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:36,632 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:36,633 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:36,633 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:36,633 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:36,633 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 01:00:36,633 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 01:00:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 01:00:36,638 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:36,638 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] [2018-01-21 01:00:36,638 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:36,639 INFO L82 PathProgramCache]: Analyzing trace with hash 748584202, now seen corresponding path program 1 times [2018-01-21 01:00:36,639 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:36,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:36,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:36,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:36,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:36,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:36,692 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-21 01:00:36,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:36,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:00:36,694 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:36,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:00:36,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:00:36,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:00:36,780 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-01-21 01:00:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:36,798 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-01-21 01:00:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:00:36,799 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 01:00:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:36,808 INFO L225 Difference]: With dead ends: 92 [2018-01-21 01:00:36,808 INFO L226 Difference]: Without dead ends: 48 [2018-01-21 01:00:36,811 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-21 01:00:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-21 01:00:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-21 01:00:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-21 01:00:36,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-21 01:00:36,839 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 21 [2018-01-21 01:00:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:36,839 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-21 01:00:36,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:00:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-21 01:00:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 01:00:36,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:36,840 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:36,840 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash 482191050, now seen corresponding path program 1 times [2018-01-21 01:00:36,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:36,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:36,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:36,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:36,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:36,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:36,956 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-21 01:00:36,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:36,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 01:00:36,956 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:36,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 01:00:36,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 01:00:36,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:00:36,959 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2018-01-21 01:00:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:37,041 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-01-21 01:00:37,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 01:00:37,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-21 01:00:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:37,043 INFO L225 Difference]: With dead ends: 77 [2018-01-21 01:00:37,043 INFO L226 Difference]: Without dead ends: 58 [2018-01-21 01:00:37,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 01:00:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-21 01:00:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-01-21 01:00:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 01:00:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-21 01:00:37,052 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2018-01-21 01:00:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:37,052 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-21 01:00:37,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 01:00:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-21 01:00:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 01:00:37,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:37,054 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:37,054 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash 853755939, now seen corresponding path program 1 times [2018-01-21 01:00:37,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:37,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:37,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:37,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:37,056 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:37,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:00:37,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:37,540 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:00:37,541 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-21 01:00:37,543 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [9], [13], [15], [18], [39], [41], [44], [46], [47], [48], [49], [55], [57], [58], [59], [63], [64], [68], [70], [73], [83], [85], [88], [96], [103], [105], [106], [113], [114], [119], [126], [127], [128], [129] [2018-01-21 01:00:37,602 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:00:37,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:00:38,138 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:00:38,139 INFO L268 AbstractInterpreter]: Visited 37 different actions 83 times. Merged at 22 different actions 44 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-01-21 01:00:38,147 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:00:38,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:38,147 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 01:00:38,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:38,158 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:00:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:38,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:38,229 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|))) is different from true [2018-01-21 01:00:38,259 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc8.base| Int) (|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc8.base| 1)))) is different from true [2018-01-21 01:00:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:38,307 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:38,339 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc8.base_8| Int)) (not (= (store |c_#valid| |v_main_#t~malloc8.base_8| 1) |c_old(#valid)|))) is different from false [2018-01-21 01:00:38,352 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc8.base_8| Int) (|v_main_#t~malloc0.base_6| Int)) (or (not (= (store (store |c_#valid| |v_main_#t~malloc0.base_6| 1) |v_main_#t~malloc8.base_8| 1) |c_old(#valid)|)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_6|))))) is different from false [2018-01-21 01:00:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:38,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:38,400 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:00:38,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:38,408 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:00:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:38,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:38,749 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-21 01:00:38,752 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-21 01:00:38,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:38,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:38,770 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-21 01:00:38,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-21 01:00:38,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-21 01:00:38,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-21 01:00:38,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:38,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:38,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:00:38,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2018-01-21 01:00:38,930 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (and (= (select .cse0 |c_main_#t~mem10.base|) 0) (= |c_#valid| (store .cse0 |c_main_#t~mem10.base| 1))))) is different from true [2018-01-21 01:00:38,948 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= |c_#valid| (store .cse0 main_~p~6.base 1)) (= 0 (select .cse0 main_~p~6.base))))) is different from true [2018-01-21 01:00:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:38,981 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:39,132 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc8.base_12| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc8.base_12|))) (not (= (store |c_#valid| |v_main_#t~malloc8.base_12| 1) |c_old(#valid)|)))) is different from false [2018-01-21 01:00:39,152 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_10| Int) (|v_main_#t~malloc8.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_10| 1))) (or (not (= (select .cse0 |v_main_#t~malloc8.base_12|) 0)) (not (= (store .cse0 |v_main_#t~malloc8.base_12| 1) |c_old(#valid)|))))) is different from false [2018-01-21 01:00:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:39,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:00:39,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5, 12, 5] total 32 [2018-01-21 01:00:39,190 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:00:39,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 01:00:39,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 01:00:39,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=482, Unknown=8, NotChecked=408, Total=992 [2018-01-21 01:00:39,191 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 18 states. [2018-01-21 01:00:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:40,045 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2018-01-21 01:00:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-21 01:00:40,046 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-01-21 01:00:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:40,049 INFO L225 Difference]: With dead ends: 124 [2018-01-21 01:00:40,049 INFO L226 Difference]: Without dead ends: 91 [2018-01-21 01:00:40,050 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=1326, Unknown=38, NotChecked=680, Total=2352 [2018-01-21 01:00:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-21 01:00:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 64. [2018-01-21 01:00:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 01:00:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-21 01:00:40,057 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 39 [2018-01-21 01:00:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:40,057 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-21 01:00:40,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 01:00:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-21 01:00:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 01:00:40,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:40,058 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:40,059 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1994399343, now seen corresponding path program 1 times [2018-01-21 01:00:40,059 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:40,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:40,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:40,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:40,060 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:40,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:00:40,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:40,342 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:00:40,342 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-21 01:00:40,343 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [9], [13], [15], [18], [20], [21], [22], [23], [29], [31], [32], [33], [39], [41], [44], [63], [64], [68], [70], [73], [83], [85], [88], [96], [103], [105], [106], [113], [114], [119], [126], [127], [128], [129] [2018-01-21 01:00:40,345 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 01:00:40,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 01:00:40,674 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 01:00:40,675 INFO L268 AbstractInterpreter]: Visited 37 different actions 89 times. Merged at 25 different actions 50 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-01-21 01:00:40,677 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 01:00:40,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:40,677 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 01:00:40,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:40,685 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:00:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:40,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:40,714 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|))) is different from true [2018-01-21 01:00:40,740 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int) (|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc0.base| 1) |main_#t~malloc3.base| 1)))) is different from true [2018-01-21 01:00:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:40,773 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:40,794 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_8| Int)) (not (= (store |c_#valid| |v_main_#t~malloc3.base_8| 1) |c_old(#valid)|))) is different from false [2018-01-21 01:00:40,802 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_8| Int) (|v_main_#t~malloc0.base_14| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc0.base_14|) 0)) (not (= |c_old(#valid)| (store (store |c_#valid| |v_main_#t~malloc0.base_14| 1) |v_main_#t~malloc3.base_8| 1))))) is different from false [2018-01-21 01:00:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:40,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:40,841 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:00:40,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:40,845 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 01:00:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:40,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:41,147 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-21 01:00:41,151 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-21 01:00:41,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:41,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:41,160 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-21 01:00:41,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-21 01:00:41,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-21 01:00:41,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-21 01:00:41,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:41,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:41,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:00:41,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2018-01-21 01:00:41,225 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (and (= (select .cse0 |c_main_#t~mem5.base|) 0) (= |c_#valid| (store .cse0 |c_main_#t~mem5.base| 1))))) is different from true [2018-01-21 01:00:41,229 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_2 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_2 1))) (and (= 0 (select .cse0 main_~p~6.base)) (= |c_#valid| (store .cse0 main_~p~6.base 1))))) is different from true [2018-01-21 01:00:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:41,260 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:41,305 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_12| Int)) (or (not (= (store |c_#valid| |v_main_#t~malloc3.base_12| 1) |c_old(#valid)|)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_12|))))) is different from false [2018-01-21 01:00:41,315 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_12| Int) (|v_main_#t~malloc0.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_18| 1))) (or (not (= |c_old(#valid)| (store .cse0 |v_main_#t~malloc3.base_12| 1))) (not (= (select .cse0 |v_main_#t~malloc3.base_12|) 0))))) is different from false [2018-01-21 01:00:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-21 01:00:41,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:00:41,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5, 12, 5] total 32 [2018-01-21 01:00:41,333 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:00:41,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-21 01:00:41,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-21 01:00:41,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=482, Unknown=8, NotChecked=408, Total=992 [2018-01-21 01:00:41,334 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 18 states. [2018-01-21 01:00:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:41,913 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-01-21 01:00:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-21 01:00:41,913 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-01-21 01:00:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:41,914 INFO L225 Difference]: With dead ends: 132 [2018-01-21 01:00:41,914 INFO L226 Difference]: Without dead ends: 99 [2018-01-21 01:00:41,916 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1326, Unknown=38, NotChecked=680, Total=2352 [2018-01-21 01:00:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-21 01:00:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 74. [2018-01-21 01:00:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 01:00:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-21 01:00:41,924 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2018-01-21 01:00:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:41,924 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-21 01:00:41,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-21 01:00:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-21 01:00:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 01:00:41,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:41,925 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:41,925 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 01:00:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 917884476, now seen corresponding path program 2 times [2018-01-21 01:00:41,926 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:41,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:41,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:41,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:41,927 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:41,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:00:42,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:42,368 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 01:00:42,368 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 01:00:42,369 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 01:00:42,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:42,369 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-21 01:00:42,376 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:00:42,376 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:00:42,390 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:42,400 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:42,403 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:00:42,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:42,423 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (and (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|))) is different from true [2018-01-21 01:00:42,441 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc8.base| Int) (|main_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= (select .cse0 |main_#t~malloc8.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= |c_#valid| (store .cse0 |main_#t~malloc8.base| 1))))) is different from true [2018-01-21 01:00:42,470 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc8.base| Int) (|main_#t~malloc0.base| Int) (v_prenex_1 Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (let ((.cse0 (store .cse1 v_prenex_1 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc8.base| 1)) (= (select .cse1 v_prenex_1) 0) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= 0 (select .cse0 |main_#t~malloc8.base|)))))) is different from true [2018-01-21 01:00:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2018-01-21 01:00:42,517 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:42,558 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc8.base_18| Int)) (or (not (= (store |c_#valid| |v_main_#t~malloc8.base_18| 1) |c_old(#valid)|)) (not (= 0 (select |c_#valid| |v_main_#t~malloc8.base_18|))))) is different from false [2018-01-21 01:00:42,570 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc8.base_19| Int) (|v_main_#t~malloc8.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc8.base_19| 1))) (or (not (= (store .cse0 |v_main_#t~malloc8.base_18| 1) |c_old(#valid)|)) (not (= 0 (select |c_#valid| |v_main_#t~malloc8.base_19|))) (not (= 0 (select .cse0 |v_main_#t~malloc8.base_18|)))))) is different from false [2018-01-21 01:00:42,585 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc8.base_19| Int) (|v_main_#t~malloc0.base_22| Int) (|v_main_#t~malloc8.base_18| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc0.base_22| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc8.base_19| 1))) (or (not (= |c_old(#valid)| (store .cse0 |v_main_#t~malloc8.base_18| 1))) (not (= 0 (select .cse1 |v_main_#t~malloc8.base_19|))) (not (= 0 (select .cse0 |v_main_#t~malloc8.base_18|))) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_22|))))))) is different from false [2018-01-21 01:00:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2018-01-21 01:00:42,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 01:00:42,611 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 01:00:42,614 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 01:00:42,614 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 01:00:42,628 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:42,644 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 01:00:42,659 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 01:00:42,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 01:00:42,748 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-21 01:00:42,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 01:00:42,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-21 01:00:42,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-21 01:00:42,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:42,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-21 01:00:42,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,877 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-21 01:00:42,879 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-21 01:00:42,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,895 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-21 01:00:42,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:36 [2018-01-21 01:00:42,938 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 24 treesize of output 20 [2018-01-21 01:00:42,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 20 treesize of output 8 [2018-01-21 01:00:42,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:42,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-01-21 01:00:43,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 01:00:43,004 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-21 01:00:43,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-21 01:00:43,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 01:00:43,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2018-01-21 01:00:43,106 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-21 01:00:43,109 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-21 01:00:43,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-21 01:00:43,167 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-21 01:00:43,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,199 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-21 01:00:43,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:42 [2018-01-21 01:00:43,232 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 21 treesize of output 17 [2018-01-21 01:00:43,234 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 17 treesize of output 5 [2018-01-21 01:00:43,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,248 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-21 01:00:43,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:36 [2018-01-21 01:00:43,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 57 [2018-01-21 01:00:43,354 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-21 01:00:43,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-21 01:00:43,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-01-21 01:00:43,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-21 01:00:43,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-01-21 01:00:43,489 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-21 01:00:43,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:00:43,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-01-21 01:00:43,528 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:47, output treesize:116 [2018-01-21 01:00:43,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,744 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 40 treesize of output 38 [2018-01-21 01:00:43,747 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-21 01:00:43,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,758 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-21 01:00:43,759 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,816 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 40 treesize of output 38 [2018-01-21 01:00:43,819 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-21 01:00:43,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,830 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-21 01:00:43,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,882 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2018-01-21 01:00:43,886 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 47 treesize of output 42 [2018-01-21 01:00:43,887 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,942 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 38 treesize of output 34 [2018-01-21 01:00:43,942 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:43,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:43,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-01-21 01:00:43,991 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:44,036 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 47 treesize of output 42 [2018-01-21 01:00:44,036 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:44,078 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 42 treesize of output 35 [2018-01-21 01:00:44,079 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:44,119 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 30 [2018-01-21 01:00:44,119 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:44,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:44,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 01:00:44,175 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 43 treesize of output 37 [2018-01-21 01:00:44,176 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:44,214 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 37 treesize of output 30 [2018-01-21 01:00:44,214 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:44,244 INFO L267 ElimStorePlain]: Start of recursive call 8: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:00:44,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-2 vars, End of recursive call: 13 dim-0 vars, and 5 xjuncts. [2018-01-21 01:00:44,318 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:128, output treesize:127 [2018-01-21 01:00:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:00:45,500 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 01:00:45,675 WARN L143 SmtUtils]: Spent 173ms on a formula simplification that was a NOOP. DAG size: 106 [2018-01-21 01:00:46,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:46,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:46,012 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-21 01:00:46,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:00:46,022 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 2 xjuncts. [2018-01-21 01:00:46,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-21 01:00:46,119 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-21 01:00:46,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:46,126 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 7 treesize of output 6 [2018-01-21 01:00:46,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:46,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-21 01:00:46,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:32 [2018-01-21 01:00:46,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:46,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:46,444 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-21 01:00:46,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:00:46,454 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:00:46,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 01:00:46,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-01-21 01:00:46,481 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:76, output treesize:72 [2018-01-21 01:00:50,660 WARN L146 SmtUtils]: Spent 4067ms on a formula simplification. DAG size of input: 52 DAG size of output 52 [2018-01-21 01:00:52,760 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-21 01:00:54,859 WARN L143 SmtUtils]: Spent 2028ms on a formula simplification that was a NOOP. DAG size: 65 [2018-01-21 01:00:54,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-01-21 01:00:54,894 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-21 01:00:54,905 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:54,905 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:54,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:00:54,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:54,907 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 17 treesize of output 11 [2018-01-21 01:00:54,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:54,914 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:00:54,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:00:54,931 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 41 treesize of output 39 [2018-01-21 01:00:54,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-01-21 01:00:54,941 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:54,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-01-21 01:00:54,947 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:54,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 44 [2018-01-21 01:00:55,004 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,005 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,006 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,006 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-01-21 01:00:55,007 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,009 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,010 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 29 treesize of output 20 [2018-01-21 01:00:55,010 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,054 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,060 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2018-01-21 01:00:55,061 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-01-21 01:00:55,064 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,066 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,068 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,068 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 37 [2018-01-21 01:00:55,080 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-01-21 01:00:55,115 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-21 01:00:55,133 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:00:55,149 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:00:55,169 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-21 01:00:55,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-21 01:00:55,225 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 6 treesize of output 1 [2018-01-21 01:00:55,225 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,228 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,230 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 33 treesize of output 31 [2018-01-21 01:00:55,232 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-21 01:00:55,242 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 17 treesize of output 11 [2018-01-21 01:00:55,242 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,243 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,244 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 01:00:55,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-21 01:00:55,244 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-21 01:00:55,251 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:00:55,262 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-21 01:00:55,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 8 xjuncts. [2018-01-21 01:00:55,321 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:90, output treesize:136 [2018-01-21 01:00:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 01:00:57,630 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 01:00:57,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 6, 6, 23, 22] total 67 [2018-01-21 01:00:57,630 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 01:00:57,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-21 01:00:57,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-21 01:00:57,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=3216, Unknown=7, NotChecked=738, Total=4422 [2018-01-21 01:00:57,632 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 24 states. [2018-01-21 01:00:59,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:59,381 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2018-01-21 01:00:59,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-21 01:00:59,381 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-01-21 01:00:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:59,382 INFO L225 Difference]: With dead ends: 118 [2018-01-21 01:00:59,382 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 01:00:59,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=912, Invalid=4927, Unknown=37, NotChecked=930, Total=6806 [2018-01-21 01:00:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 01:00:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 01:00:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 01:00:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 01:00:59,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-21 01:00:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:59,386 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 01:00:59,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-21 01:00:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 01:00:59,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 01:00:59,388 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 01:00:59,389 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 01:00:59,389 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 01:00:59,389 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 01:00:59,389 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 01:00:59,389 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 01:00:59,389 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 01:00:59,389 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 01:00:59,389 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 01:00:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 01:00:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 01:00:59,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:59,392 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:59,393 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 01:00:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash 394074613, now seen corresponding path program 1 times [2018-01-21 01:00:59,393 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:59,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:59,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,394 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 01:00:59,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 01:00:59,406 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-21 01:00:59,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 01:00:59,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 01:00:59,406 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 01:00:59,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 01:00:59,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 01:00:59,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 01:00:59,407 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-01-21 01:00:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 01:00:59,411 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2018-01-21 01:00:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 01:00:59,411 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 01:00:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 01:00:59,413 INFO L225 Difference]: With dead ends: 92 [2018-01-21 01:00:59,413 INFO L226 Difference]: Without dead ends: 46 [2018-01-21 01:00:59,413 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-21 01:00:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-21 01:00:59,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-21 01:00:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-21 01:00:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-21 01:00:59,418 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 19 [2018-01-21 01:00:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 01:00:59,418 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-21 01:00:59,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 01:00:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-21 01:00:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 01:00:59,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 01:00:59,419 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 01:00:59,420 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 01:00:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash -455363659, now seen corresponding path program 1 times [2018-01-21 01:00:59,420 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 01:00:59,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 01:00:59,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 01:00:59,421 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 01:00:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 01:00:59,450 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 01:00:59,454 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:00:59,458 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 01:00:59,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 01:00:59 BoogieIcfgContainer [2018-01-21 01:00:59,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 01:00:59,472 INFO L168 Benchmark]: Toolchain (without parser) took 23706.02 ms. Allocated memory was 302.5 MB in the beginning and 615.0 MB in the end (delta: 312.5 MB). Free memory was 260.7 MB in the beginning and 583.7 MB in the end (delta: -323.0 MB). Peak memory consumption was 264.4 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:59,472 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.5 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 01:00:59,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.72 ms. Allocated memory is still 302.5 MB. Free memory was 259.7 MB in the beginning and 249.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:59,473 INFO L168 Benchmark]: Boogie Preprocessor took 39.16 ms. Allocated memory is still 302.5 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:59,473 INFO L168 Benchmark]: RCFGBuilder took 291.49 ms. Allocated memory is still 302.5 MB. Free memory was 247.7 MB in the beginning and 227.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:59,474 INFO L168 Benchmark]: TraceAbstraction took 23144.13 ms. Allocated memory was 302.5 MB in the beginning and 615.0 MB in the end (delta: 312.5 MB). Free memory was 226.4 MB in the beginning and 583.7 MB in the end (delta: -357.3 MB). Peak memory consumption was 230.1 MB. Max. memory is 5.3 GB. [2018-01-21 01:00:59,475 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.18 ms. Allocated memory is still 302.5 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.72 ms. Allocated memory is still 302.5 MB. Free memory was 259.7 MB in the beginning and 249.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.16 ms. Allocated memory is still 302.5 MB. Free memory was 249.7 MB in the beginning and 247.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 291.49 ms. Allocated memory is still 302.5 MB. Free memory was 247.7 MB in the beginning and 227.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 23144.13 ms. Allocated memory was 302.5 MB in the beginning and 615.0 MB in the end (delta: 312.5 MB). Free memory was 226.4 MB in the beginning and 583.7 MB in the end (delta: -357.3 MB). Peak memory consumption was 230.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 365 LocStat_NO_SUPPORTING_DISEQUALITIES : 117 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 53 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 43 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.635215 RENAME_VARIABLES(MILLISECONDS) : 0.235013 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.587396 PROJECTAWAY(MILLISECONDS) : 0.106982 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001496 DISJOIN(MILLISECONDS) : 0.983383 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.269090 ADD_EQUALITY(MILLISECONDS) : 0.051246 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020369 #CONJOIN_DISJUNCTIVE : 143 #RENAME_VARIABLES : 265 #UNFREEZE : 0 #CONJOIN : 187 #PROJECTAWAY : 174 #ADD_WEAK_EQUALITY : 23 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 260 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 36 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 347 LocStat_NO_SUPPORTING_DISEQUALITIES : 114 LocStat_NO_DISJUNCTIONS : -72 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 53 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 43 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.474515 RENAME_VARIABLES(MILLISECONDS) : 0.187499 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.447540 PROJECTAWAY(MILLISECONDS) : 0.079614 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001001 DISJOIN(MILLISECONDS) : 0.762715 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.214982 ADD_EQUALITY(MILLISECONDS) : 0.027433 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017705 #CONJOIN_DISJUNCTIVE : 155 #RENAME_VARIABLES : 289 #UNFREEZE : 0 #CONJOIN : 199 #PROJECTAWAY : 186 #ADD_WEAK_EQUALITY : 23 #DISJOIN : 21 #RENAME_VARIABLES_DISJUNCTIVE : 284 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 60 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=57occurred 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, 12 PreInvPairs, 12 NumberOfFragments, 10 HoareAnnotationTreeSize, 12 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, 60 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=57occurred 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 - PositiveResult [Line: 1]: 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: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 60 locations, 4 error locations. SAFE Result, 22.7s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 213 SDtfs, 1437 SDslu, 868 SDs, 0 SdLazy, 1013 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 431 SyntacticMatches, 4 SemanticMatches, 177 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 2086 ImplicationChecksByTransitivity, 16.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 56 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 431 NumberOfCodeBlocks, 431 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 668 ConstructedInterpolants, 249 QuantifiedInterpolants, 425646 SizeOfPredicates, 58 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 0/110 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={10:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L628] COND FALSE !(a == 0) VAL [a={10:0}, malloc(sizeof(struct node))={10:0}] [L629] List t; [L630] List p = a; VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L646] p = a VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] [L647] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR, FCALL p->h VAL [a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={10:0}, malloc(sizeof(struct node))={10:0}, p={10:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 60 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 631]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 647]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_01-00-59-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_01-00-59-485.csv Received shutdown request...