java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:51:52,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:51:52,484 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:51:52,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:51:52,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:51:52,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:51:52,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:51:52,502 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:51:52,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:51:52,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:51:52,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:51:52,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:51:52,507 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:51:52,508 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:51:52,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:51:52,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:51:52,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:51:52,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:51:52,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:51:52,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:51:52,521 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:51:52,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:51:52,521 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:51:52,522 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:51:52,523 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:51:52,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:51:52,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:51:52,526 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:51:52,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:51:52,526 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:51:52,527 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:51:52,527 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:51:52,537 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:51:52,538 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:51:52,539 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:51:52,539 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:51:52,539 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:51:52,539 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:51:52,539 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:51:52,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:51:52,540 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:51:52,541 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:51:52,541 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:51:52,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:51:52,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:51:52,541 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:51:52,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:51:52,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:51:52,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:51:52,542 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:51:52,542 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:51:52,542 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:51:52,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:51:52,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:51:52,543 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:51:52,543 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:51:52,543 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:51:52,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:51:52,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:51:52,544 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:51:52,544 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:51:52,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:51:52,545 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:51:52,545 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:51:52,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:51:52,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:51:52,545 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:51:52,546 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:51:52,547 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:51:52,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:51:52,596 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:51:52,601 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:51:52,602 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:51:52,603 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:51:52,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:51:52,790 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:51:52,796 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:51:52,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:51:52,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:51:52,804 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:51:52,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:51:52" (1/1) ... [2018-01-23 14:51:52,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3072b9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:52, skipping insertion in model container [2018-01-23 14:51:52,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:51:52" (1/1) ... [2018-01-23 14:51:52,828 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:51:52,872 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:51:52,993 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:51:53,012 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:51:53,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53 WrapperNode [2018-01-23 14:51:53,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:51:53,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:51:53,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:51:53,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:51:53,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... [2018-01-23 14:51:53,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... [2018-01-23 14:51:53,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... [2018-01-23 14:51:53,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... [2018-01-23 14:51:53,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... [2018-01-23 14:51:53,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... [2018-01-23 14:51:53,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... [2018-01-23 14:51:53,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:51:53,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:51:53,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:51:53,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:51:53,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:51:53,109 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:51:53,109 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:51:53,109 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-23 14:51:53,109 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:51:53,110 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:51:53,110 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:51:53,110 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:51:53,110 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:51:53,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:51:53,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:51:53,111 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:51:53,111 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-23 14:51:53,111 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:51:53,111 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:51:53,111 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-23 14:51:53,111 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:51:53,111 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:51:53,112 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:51:53,401 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:51:53,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:51:53 BoogieIcfgContainer [2018-01-23 14:51:53,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:51:53,403 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:51:53,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:51:53,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:51:53,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:51:52" (1/3) ... [2018-01-23 14:51:53,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c01b48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:51:53, skipping insertion in model container [2018-01-23 14:51:53,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:51:53" (2/3) ... [2018-01-23 14:51:53,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c01b48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:51:53, skipping insertion in model container [2018-01-23 14:51:53,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:51:53" (3/3) ... [2018-01-23 14:51:53,408 INFO L105 eAbstractionObserver]: Analyzing ICFG splice_true-unreach-call_false-valid-memtrack.i [2018-01-23 14:51:53,414 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:51:53,421 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-23 14:51:53,462 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:53,462 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:53,462 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:53,462 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:53,462 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:53,462 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:53,462 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:53,463 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-23 14:51:53,463 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-23 14:51:53,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:51:53,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 64 states. [2018-01-23 14:51:53,565 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-23 14:51:53,565 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:51:53,566 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-23 14:51:53,566 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-23 14:51:53,566 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-23 14:51:53,566 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 680) no Hoare annotation was computed. [2018-01-23 14:51:53,567 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 680) no Hoare annotation was computed. [2018-01-23 14:51:53,567 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 680) the Hoare annotation is: true [2018-01-23 14:51:53,567 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 680) no Hoare annotation was computed. [2018-01-23 14:51:53,567 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 680) the Hoare annotation is: true [2018-01-23 14:51:53,567 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 680) no Hoare annotation was computed. [2018-01-23 14:51:53,568 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 680) the Hoare annotation is: true [2018-01-23 14:51:53,568 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 680) no Hoare annotation was computed. [2018-01-23 14:51:53,568 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 680) no Hoare annotation was computed. [2018-01-23 14:51:53,568 INFO L401 ceAbstractionStarter]: For program point L659'(line 659) no Hoare annotation was computed. [2018-01-23 14:51:53,568 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-23 14:51:53,568 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-23 14:51:53,568 INFO L401 ceAbstractionStarter]: For program point L675'(line 675) no Hoare annotation was computed. [2018-01-23 14:51:53,569 INFO L404 ceAbstractionStarter]: At program point L674''(lines 674 677) the Hoare annotation is: true [2018-01-23 14:51:53,569 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-23 14:51:53,569 INFO L401 ceAbstractionStarter]: For program point L629'''(line 629) no Hoare annotation was computed. [2018-01-23 14:51:53,569 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 680) no Hoare annotation was computed. [2018-01-23 14:51:53,569 INFO L401 ceAbstractionStarter]: For program point L636'(lines 636 648) no Hoare annotation was computed. [2018-01-23 14:51:53,570 INFO L401 ceAbstractionStarter]: For program point L676'(line 676) no Hoare annotation was computed. [2018-01-23 14:51:53,570 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-23 14:51:53,570 INFO L401 ceAbstractionStarter]: For program point L645(line 645) no Hoare annotation was computed. [2018-01-23 14:51:53,570 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-23 14:51:53,570 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-23 14:51:53,570 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-23 14:51:53,571 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-23 14:51:53,571 INFO L401 ceAbstractionStarter]: For program point L657'(line 657) no Hoare annotation was computed. [2018-01-23 14:51:53,571 INFO L404 ceAbstractionStarter]: At program point L645'(line 645) the Hoare annotation is: true [2018-01-23 14:51:53,571 INFO L404 ceAbstractionStarter]: At program point L629'(line 629) the Hoare annotation is: true [2018-01-23 14:51:53,571 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 680) no Hoare annotation was computed. [2018-01-23 14:51:53,572 INFO L404 ceAbstractionStarter]: At program point L675''(line 675) the Hoare annotation is: true [2018-01-23 14:51:53,572 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:51:53,572 INFO L401 ceAbstractionStarter]: For program point L637(lines 637 643) no Hoare annotation was computed. [2018-01-23 14:51:53,572 INFO L401 ceAbstractionStarter]: For program point L636(lines 636 648) no Hoare annotation was computed. [2018-01-23 14:51:53,572 INFO L401 ceAbstractionStarter]: For program point L637''(lines 637 643) no Hoare annotation was computed. [2018-01-23 14:51:53,573 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-23 14:51:53,573 INFO L401 ceAbstractionStarter]: For program point L645'''(line 645) no Hoare annotation was computed. [2018-01-23 14:51:53,573 INFO L401 ceAbstractionStarter]: For program point L670'(line 670) no Hoare annotation was computed. [2018-01-23 14:51:53,573 INFO L401 ceAbstractionStarter]: For program point L669(lines 669 672) no Hoare annotation was computed. [2018-01-23 14:51:53,573 INFO L404 ceAbstractionStarter]: At program point L669''(lines 669 672) the Hoare annotation is: true [2018-01-23 14:51:53,574 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-23 14:51:53,574 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-23 14:51:53,574 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 626 680) no Hoare annotation was computed. [2018-01-23 14:51:53,574 INFO L401 ceAbstractionStarter]: For program point L655(lines 655 667) no Hoare annotation was computed. [2018-01-23 14:51:53,574 INFO L401 ceAbstractionStarter]: For program point L671'(line 671) no Hoare annotation was computed. [2018-01-23 14:51:53,574 INFO L401 ceAbstractionStarter]: For program point L659(line 659) no Hoare annotation was computed. [2018-01-23 14:51:53,575 INFO L401 ceAbstractionStarter]: For program point L658(lines 658 666) no Hoare annotation was computed. [2018-01-23 14:51:53,575 INFO L401 ceAbstractionStarter]: For program point L657(line 657) no Hoare annotation was computed. [2018-01-23 14:51:53,575 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 680) the Hoare annotation is: true [2018-01-23 14:51:53,575 INFO L404 ceAbstractionStarter]: At program point L636'''(lines 636 648) the Hoare annotation is: true [2018-01-23 14:51:53,576 INFO L401 ceAbstractionStarter]: For program point L674'''(lines 674 677) no Hoare annotation was computed. [2018-01-23 14:51:53,576 INFO L401 ceAbstractionStarter]: For program point L628'(line 628) no Hoare annotation was computed. [2018-01-23 14:51:53,576 INFO L401 ceAbstractionStarter]: For program point L670(line 670) no Hoare annotation was computed. [2018-01-23 14:51:53,576 INFO L401 ceAbstractionStarter]: For program point L674(lines 674 677) no Hoare annotation was computed. [2018-01-23 14:51:53,576 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-23 14:51:53,576 INFO L401 ceAbstractionStarter]: For program point L641'(line 641) no Hoare annotation was computed. [2018-01-23 14:51:53,577 INFO L401 ceAbstractionStarter]: For program point L669'''(lines 669 672) no Hoare annotation was computed. [2018-01-23 14:51:53,577 INFO L401 ceAbstractionStarter]: For program point L676(line 676) no Hoare annotation was computed. [2018-01-23 14:51:53,577 INFO L401 ceAbstractionStarter]: For program point L675(line 675) no Hoare annotation was computed. [2018-01-23 14:51:53,577 INFO L404 ceAbstractionStarter]: At program point L658''(lines 658 666) the Hoare annotation is: true [2018-01-23 14:51:53,577 INFO L401 ceAbstractionStarter]: For program point L638'(line 638) no Hoare annotation was computed. [2018-01-23 14:51:53,577 INFO L401 ceAbstractionStarter]: For program point L636''''(lines 636 648) no Hoare annotation was computed. [2018-01-23 14:51:53,578 INFO L401 ceAbstractionStarter]: For program point L655'''(lines 655 667) no Hoare annotation was computed. [2018-01-23 14:51:53,582 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:53,583 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:53,583 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:53,583 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:53,583 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:53,583 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:53,583 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:53,584 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:51:53,584 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-23 14:51:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:51:53,587 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:53,589 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:51:53,589 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:51:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash 171440, now seen corresponding path program 1 times [2018-01-23 14:51:53,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:53,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:53,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:53,622 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:53,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:51:53,688 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:51:53,694 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:51:53,701 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:51:53,701 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:51:53,701 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:51:53,701 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:51:53,701 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:51:53,702 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:51:53,702 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:51:53,702 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:51:53,702 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:51:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-23 14:51:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-23 14:51:53,706 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:53,706 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:53,706 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash -999156771, now seen corresponding path program 1 times [2018-01-23 14:51:53,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:53,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:53,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:53,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:53,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:53,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:53,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:53,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:51:53,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:51:53,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:51:53,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:51:53,855 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-23 14:51:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:53,877 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-01-23 14:51:53,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:51:53,878 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-23 14:51:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:53,888 INFO L225 Difference]: With dead ends: 99 [2018-01-23 14:51:53,888 INFO L226 Difference]: Without dead ends: 56 [2018-01-23 14:51:53,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:51:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-23 14:51:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-23 14:51:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-23 14:51:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-01-23 14:51:53,924 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 17 [2018-01-23 14:51:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:53,924 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-01-23 14:51:53,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:51:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-01-23 14:51:53,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:51:53,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:53,926 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-23 14:51:53,926 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:53,926 INFO L82 PathProgramCache]: Analyzing trace with hash -564250623, now seen corresponding path program 1 times [2018-01-23 14:51:53,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:53,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:53,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:53,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:53,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:53,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:54,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:54,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:51:54,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:51:54,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:51:54,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:51:54,018 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 4 states. [2018-01-23 14:51:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:54,082 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-01-23 14:51:54,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:51:54,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-23 14:51:54,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:54,085 INFO L225 Difference]: With dead ends: 97 [2018-01-23 14:51:54,085 INFO L226 Difference]: Without dead ends: 65 [2018-01-23 14:51:54,086 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-23 14:51:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-23 14:51:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-01-23 14:51:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-23 14:51:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-01-23 14:51:54,095 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 19 [2018-01-23 14:51:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:54,095 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-01-23 14:51:54,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:51:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-01-23 14:51:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-23 14:51:54,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:54,097 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] [2018-01-23 14:51:54,097 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:54,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2078626135, now seen corresponding path program 1 times [2018-01-23 14:51:54,097 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:54,097 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:54,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:54,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:54,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:54,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:54,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:54,287 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:54,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:54,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:54,433 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-23 14:51:54,445 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int) (|main_#t~malloc4.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc4.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc0.base|) 0) (= (select .cse0 |main_#t~malloc4.base|) 0)))) is different from true [2018-01-23 14:51:54,483 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-23 14:51:54,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:54,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-01-23 14:51:54,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:51:54,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:51:54,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=39, Unknown=2, NotChecked=26, Total=90 [2018-01-23 14:51:54,519 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 10 states. [2018-01-23 14:51:54,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:54,740 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-01-23 14:51:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-23 14:51:54,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-23 14:51:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:54,742 INFO L225 Difference]: With dead ends: 153 [2018-01-23 14:51:54,742 INFO L226 Difference]: Without dead ends: 77 [2018-01-23 14:51:54,743 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=78, Unknown=2, NotChecked=38, Total=156 [2018-01-23 14:51:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-23 14:51:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2018-01-23 14:51:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-23 14:51:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-23 14:51:54,752 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 31 [2018-01-23 14:51:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:54,753 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-23 14:51:54,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:51:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-23 14:51:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-23 14:51:54,754 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:54,754 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:54,754 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:54,755 INFO L82 PathProgramCache]: Analyzing trace with hash -225240659, now seen corresponding path program 2 times [2018-01-23 14:51:54,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:54,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:54,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:54,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:54,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:54,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:54,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:51:54,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:51:54,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:51:54,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:51:54,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:51:54,815 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 3 states. [2018-01-23 14:51:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:54,871 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2018-01-23 14:51:54,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:51:54,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-23 14:51:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:54,876 INFO L225 Difference]: With dead ends: 153 [2018-01-23 14:51:54,877 INFO L226 Difference]: Without dead ends: 107 [2018-01-23 14:51:54,877 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:51:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-23 14:51:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2018-01-23 14:51:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-23 14:51:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-01-23 14:51:54,887 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 43 [2018-01-23 14:51:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:54,887 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-01-23 14:51:54,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:51:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-01-23 14:51:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-23 14:51:54,889 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:54,889 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:54,889 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -842427991, now seen corresponding path program 1 times [2018-01-23 14:51:54,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:54,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:54,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:54,891 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:51:54,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:54,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:55,057 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-23 14:51:55,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:55,058 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:55,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:55,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:55,197 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int)) (= (store |c_old(#valid)| |main_#t~malloc0.base| 1) |c_#valid|)) is different from true [2018-01-23 14:51:55,205 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int) (|main_#t~malloc4.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc4.base| 1)) (= (select .cse0 |main_#t~malloc4.base|) 0)))) is different from true [2018-01-23 14:51:55,227 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc0.base| Int) (v_prenex_1 Int) (|main_#t~malloc4.base| 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~malloc4.base| 1)) (= (select .cse1 v_prenex_1) 0) (= (select .cse0 |main_#t~malloc4.base|) 0))))) is different from true [2018-01-23 14:51:55,254 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-23 14:51:55,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:55,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-01-23 14:51:55,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-23 14:51:55,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-23 14:51:55,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=67, Unknown=4, NotChecked=54, Total=156 [2018-01-23 14:51:55,277 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 13 states. [2018-01-23 14:51:55,466 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_main_#t~malloc4.base|))) (and (not (= .cse0 0)) (exists ((|main_#t~malloc0.base| Int) (|main_#t~malloc4.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (and (= |c_#valid| (store .cse1 |main_#t~malloc4.base| 1)) (= (select .cse1 |main_#t~malloc4.base|) 0)))) (not (= .cse0 (select |c_old(#valid)| |c_main_#t~malloc4.base|))))) is different from true [2018-01-23 14:51:55,516 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_main_#t~malloc4.base|))) (and (not (= .cse0 0)) (exists ((|main_#t~malloc0.base| Int) (v_prenex_1 Int) (|main_#t~malloc4.base| Int)) (let ((.cse2 (store |c_old(#valid)| |main_#t~malloc0.base| 1))) (let ((.cse1 (store .cse2 v_prenex_1 1))) (and (= |c_#valid| (store .cse1 |main_#t~malloc4.base| 1)) (= (select .cse2 v_prenex_1) 0) (= (select .cse1 |main_#t~malloc4.base|) 0))))) (not (= .cse0 (select |c_old(#valid)| |c_main_#t~malloc4.base|))))) is different from true [2018-01-23 14:51:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:51:55,621 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-01-23 14:51:55,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:51:55,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-23 14:51:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:51:55,625 INFO L225 Difference]: With dead ends: 204 [2018-01-23 14:51:55,625 INFO L226 Difference]: Without dead ends: 130 [2018-01-23 14:51:55,626 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=138, Unknown=7, NotChecked=140, Total=342 [2018-01-23 14:51:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-23 14:51:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2018-01-23 14:51:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-23 14:51:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-23 14:51:55,639 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 43 [2018-01-23 14:51:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:51:55,640 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-23 14:51:55,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-23 14:51:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-23 14:51:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-23 14:51:55,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:51:55,642 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:51:55,642 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:51:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1991013201, now seen corresponding path program 2 times [2018-01-23 14:51:55,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:51:55,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:51:55,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:55,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:51:55,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:51:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:51:55,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:51:56,596 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 32 DAG size of output 24 [2018-01-23 14:51:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:51:56,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:51:56,733 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:51:56,740 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:51:56,757 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:56,774 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:51:56,780 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:51:56,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:51:56,831 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int)) (= |c_#valid| (store |c_old(#valid)| main_~p~6.base 1))) is different from true [2018-01-23 14:51:56,843 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (|main_#t~malloc4.base| Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc4.base| 1)) (= 0 (select .cse0 |main_#t~malloc4.base|))))) is different from true [2018-01-23 14:51:56,867 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~p~6.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (let ((.cse1 (store .cse0 v_prenex_2 1))) (and (= 0 (select .cse0 v_prenex_2)) (= |c_#valid| (store .cse1 |c_main_#t~malloc4.base| 1)) (= 0 (select .cse1 |c_main_#t~malloc4.base|)))))) is different from true [2018-01-23 14:51:56,880 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~p~6.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (let ((.cse1 (store .cse0 v_prenex_2 1))) (and (= 0 (select .cse0 v_prenex_2)) (= 0 (select .cse1 c_main_~t~6.base)) (= |c_#valid| (store .cse1 c_main_~t~6.base 1)))))) is different from true [2018-01-23 14:51:56,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:56,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:56,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:56,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:44 [2018-01-23 14:51:56,920 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse0 (store .cse2 v_prenex_2 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)))) (and (= 0 (select .cse0 .cse1)) (= |c_#valid| (store .cse0 .cse1 1)) (= 0 (select .cse2 v_prenex_2)))))) is different from true [2018-01-23 14:51:56,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-23 14:51:56,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-01-23 14:51:56,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:56,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:56,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:53, output treesize:32 [2018-01-23 14:51:56,959 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse0 (store .cse1 v_prenex_2 1))) (and (= (select .cse0 |c_main_#t~mem6.base|) 0) (= |c_#valid| (store .cse0 |c_main_#t~mem6.base| 1)) (= 0 (select .cse1 v_prenex_2)))))) is different from true [2018-01-23 14:51:56,966 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse1 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse0 (store .cse1 v_prenex_2 1))) (and (= 0 (select .cse0 c_main_~p~6.base)) (= |c_#valid| (store .cse0 c_main_~p~6.base 1)) (= 0 (select .cse1 v_prenex_2)))))) is different from true [2018-01-23 14:51:57,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:57,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:57,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:57,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:61 [2018-01-23 14:51:57,099 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 51 treesize of output 45 [2018-01-23 14:51:57,103 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 45 treesize of output 30 [2018-01-23 14:51:57,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:57,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:70, output treesize:49 [2018-01-23 14:51:57,118 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int) (main_~p~6.base Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse0 (store .cse2 v_prenex_2 1))) (let ((.cse1 (store .cse0 main_~p~6.base 1))) (and (= 0 (select .cse0 main_~p~6.base)) (= 0 (select .cse1 |c_main_#t~mem6.base|)) (= 0 (select .cse2 v_prenex_2)) (= (store .cse1 |c_main_#t~mem6.base| 1) |c_#valid|)))))) is different from true [2018-01-23 14:51:57,123 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_subst_1 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse0 (store .cse2 v_prenex_2 1))) (let ((.cse1 (store .cse0 v_subst_1 1))) (and (= 0 (select .cse0 v_subst_1)) (= 0 (select .cse1 c_main_~p~6.base)) (= |c_#valid| (store .cse1 c_main_~p~6.base 1)) (= 0 (select .cse2 v_prenex_2))))))) is different from true [2018-01-23 14:51:57,145 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_subst_1 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse0 (store .cse2 v_prenex_2 1))) (let ((.cse1 (store .cse0 v_subst_1 1))) (and (= 0 (select .cse0 v_subst_1)) (= |c_#valid| (store (store .cse1 c_main_~p~6.base 1) |c_main_#t~malloc4.base| 1)) (= 0 (select .cse1 c_main_~p~6.base)) (= 0 (select .cse2 v_prenex_2))))))) is different from true [2018-01-23 14:51:57,155 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_subst_1 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse1 (store .cse2 v_prenex_2 1))) (let ((.cse0 (store .cse1 v_subst_1 1))) (and (= |c_#valid| (store (store .cse0 c_main_~p~6.base 1) c_main_~t~6.base 1)) (= 0 (select .cse1 v_subst_1)) (= 0 (select .cse0 c_main_~p~6.base)) (= 0 (select .cse2 v_prenex_2))))))) is different from true [2018-01-23 14:51:57,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-23 14:51:57,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-23 14:51:57,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:57,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:58 [2018-01-23 14:51:57,181 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int) (v_subst_1 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse1 (store .cse2 v_prenex_2 1))) (let ((.cse0 (store .cse1 v_subst_1 1))) (and (= |c_#valid| (store (store .cse0 c_main_~p~6.base 1) (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)) 1)) (= 0 (select .cse1 v_subst_1)) (= 0 (select .cse0 c_main_~p~6.base)) (= 0 (select .cse2 v_prenex_2))))))) is different from true [2018-01-23 14:51:57,185 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 34 treesize of output 30 [2018-01-23 14:51:57,187 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 30 treesize of output 18 [2018-01-23 14:51:57,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-23 14:51:57,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-23 14:51:57,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:67, output treesize:52 [2018-01-23 14:51:57,200 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int) (main_~p~6.base Int) (v_subst_1 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse1 (store .cse2 v_prenex_2 1))) (let ((.cse0 (store .cse1 v_subst_1 1))) (and (= |c_#valid| (store (store .cse0 main_~p~6.base 1) |c_main_#t~mem6.base| 1)) (= 0 (select .cse1 v_subst_1)) (= 0 (select .cse0 main_~p~6.base)) (= 0 (select .cse2 v_prenex_2))))))) is different from true [2018-01-23 14:51:57,205 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (v_prenex_3 Int) (main_~p~6.base Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse2 (store |c_old(#valid)| v_prenex_3 1))) (let ((.cse0 (store .cse2 v_prenex_2 1))) (let ((.cse1 (store .cse0 v_subst_1 1))) (and (= 0 (select .cse0 v_subst_1)) (= 0 (select .cse1 v_subst_2)) (= 0 (select .cse2 v_prenex_2)) (= |c_#valid| (store (store .cse1 v_subst_2 1) main_~p~6.base 1))))))) is different from true [2018-01-23 14:51:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 76 not checked. [2018-01-23 14:51:57,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:51:57,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 30 [2018-01-23 14:51:57,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-23 14:51:57,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-23 14:51:57,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=188, Unknown=17, NotChecked=574, Total=870 [2018-01-23 14:51:57,270 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 30 states. [2018-01-23 14:51:58,599 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 73 DAG size of output 61 [2018-01-23 14:51:58,854 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 80 DAG size of output 68 [2018-01-23 14:52:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:00,209 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2018-01-23 14:52:00,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-23 14:52:00,209 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-01-23 14:52:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:00,210 INFO L225 Difference]: With dead ends: 142 [2018-01-23 14:52:00,210 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:52:00,212 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=360, Invalid=948, Unknown=80, NotChecked=1162, Total=2550 [2018-01-23 14:52:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:52:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:52:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:52:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:52:00,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-01-23 14:52:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:00,213 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:52:00,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-23 14:52:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:52:00,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:52:00,215 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:52:00,216 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:52:00,216 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:52:00,216 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:52:00,216 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:52:00,216 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:52:00,216 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:52:00,216 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:52:00,216 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:52:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-23 14:52:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-23 14:52:00,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:00,219 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:52:00,219 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:00,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1004545766, now seen corresponding path program 1 times [2018-01-23 14:52:00,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:00,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:00,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:00,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:00,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:52:00,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:52:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:52:00,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:52:00,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:52:00,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:52:00,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:52:00,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:52:00,230 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-01-23 14:52:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:52:00,234 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-01-23 14:52:00,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:52:00,234 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-23 14:52:00,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:52:00,235 INFO L225 Difference]: With dead ends: 99 [2018-01-23 14:52:00,235 INFO L226 Difference]: Without dead ends: 54 [2018-01-23 14:52:00,236 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:52:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-23 14:52:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-23 14:52:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-23 14:52:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-23 14:52:00,241 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 15 [2018-01-23 14:52:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:52:00,242 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-23 14:52:00,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:52:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-23 14:52:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-23 14:52:00,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:52:00,243 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:52:00,243 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:52:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash 638518282, now seen corresponding path program 1 times [2018-01-23 14:52:00,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:52:00,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:52:00,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:00,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:52:00,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:52:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:52:00,257 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:52:00,260 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:00,263 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:52:00,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:52:00 BoogieIcfgContainer [2018-01-23 14:52:00,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:52:00,276 INFO L168 Benchmark]: Toolchain (without parser) took 7485.34 ms. Allocated memory was 303.0 MB in the beginning and 552.6 MB in the end (delta: 249.6 MB). Free memory was 262.0 MB in the beginning and 310.2 MB in the end (delta: -48.2 MB). Peak memory consumption was 201.4 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,277 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:52:00,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.49 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 250.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,277 INFO L168 Benchmark]: Boogie Preprocessor took 37.24 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,278 INFO L168 Benchmark]: RCFGBuilder took 343.75 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 227.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,278 INFO L168 Benchmark]: TraceAbstraction took 6872.38 ms. Allocated memory was 303.0 MB in the beginning and 552.6 MB in the end (delta: 249.6 MB). Free memory was 227.1 MB in the beginning and 310.2 MB in the end (delta: -83.1 MB). Peak memory consumption was 166.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:52:00,280 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.22 ms. Allocated memory is still 303.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.49 ms. Allocated memory is still 303.0 MB. Free memory was 262.0 MB in the beginning and 250.0 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.24 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 248.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 343.75 ms. Allocated memory is still 303.0 MB. Free memory was 248.0 MB in the beginning and 227.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6872.38 ms. Allocated memory was 303.0 MB in the beginning and 552.6 MB in the end (delta: 249.6 MB). Free memory was 227.1 MB in the beginning and 310.2 MB in the end (delta: -83.1 MB). Peak memory consumption was 166.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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, 67 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=64occurred 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, 12 LocationsWithAnnotation, 13 PreInvPairs, 13 NumberOfFragments, 12 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 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, 67 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred 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, 67 locations, 4 error locations. SAFE Result, 6.5s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 416 SDtfs, 415 SDslu, 914 SDs, 0 SdLazy, 453 SolverSat, 54 SolverUnsat, 21 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=5, 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, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 352 ConstructedInterpolants, 111 QuantifiedInterpolants, 953188 SizeOfPredicates, 33 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 18/208 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] int flag = 1; VAL [flag=1] [L628] EXPR, FCALL malloc(sizeof(struct node)) VAL [flag=1, malloc(sizeof(struct node))={10:0}] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L629] COND FALSE !(a == 0) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L630] List t; [L631] List l1; [L632] List l2; [L633] List b; [L634] List u; [L635] List p = a; VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L636] COND FALSE !(__VERIFIER_nondet_int()) [L649] FCALL p->h = 3 VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L650] EXPR, FCALL a->h VAL [a={10:0}, a->h=3, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L650] COND TRUE a->h == 3 [L650] return 0; VAL [\result=0, a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 67 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 72 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=64occurred 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, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 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: 658]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 675]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 636]: 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/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-52-00-289.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-52-00-289.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-52-00-289.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-52-00-289.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/splice_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-52-00-289.csv Received shutdown request...