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/list_flag_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:25:24,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:25:24,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:25:24,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:25:24,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:25:24,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:25:24,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:25:24,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:25:24,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:25:24,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:25:24,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:25:24,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:25:24,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:25:24,490 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:25:24,491 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:25:24,494 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:25:24,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:25:24,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:25:24,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:25:24,501 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:25:24,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:25:24,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:25:24,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:25:24,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:25:24,507 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:25:24,508 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:25:24,509 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:25:24,509 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:25:24,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:25:24,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:25:24,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:25:24,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:25:24,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:25:24,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:25:24,522 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:25:24,523 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:25:24,523 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:25:24,523 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:25:24,523 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:25:24,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:25:24,525 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:25:24,525 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:25:24,525 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:25:24,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:25:24,526 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:25:24,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:25:24,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:25:24,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:25:24,526 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:25:24,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:25:24,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:25:24,527 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:25:24,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:25:24,528 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:25:24,528 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:25:24,528 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:25:24,528 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:25:24,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:25:24,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:25:24,529 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:25:24,529 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:25:24,529 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:25:24,529 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:25:24,530 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:25:24,530 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:25:24,530 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:25:24,530 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:25:24,531 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:25:24,531 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:25:24,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:25:24,580 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:25:24,585 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:25:24,586 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:25:24,587 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:25:24,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_flag_true-unreach-call_false-valid-memtrack.i [2018-01-20 22:25:24,756 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:25:24,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:25:24,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:25:24,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:25:24,766 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:25:24,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:24,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2fa6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24, skipping insertion in model container [2018-01-20 22:25:24,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:24,782 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:25:24,818 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:25:24,936 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:25:24,955 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:25:24,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24 WrapperNode [2018-01-20 22:25:24,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:25:24,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:25:24,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:25:24,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:25:24,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:24,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:24,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:24,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:24,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:25,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:25,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... [2018-01-20 22:25:25,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:25:25,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:25:25,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:25:25,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:25:25,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:25:25,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:25:25,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:25:25,055 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-20 22:25:25,056 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:25:25,056 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:25:25,056 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:25:25,056 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:25:25,056 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:25:25,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:25:25,057 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:25:25,057 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:25:25,057 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:25:25,057 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:25:25,057 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:25:25,057 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-20 22:25:25,057 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:25:25,058 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:25:25,058 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:25:25,278 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:25:25,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:25:25 BoogieIcfgContainer [2018-01-20 22:25:25,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:25:25,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:25:25,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:25:25,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:25:25,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:25:24" (1/3) ... [2018-01-20 22:25:25,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1753b988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:25:25, skipping insertion in model container [2018-01-20 22:25:25,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:25:24" (2/3) ... [2018-01-20 22:25:25,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1753b988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:25:25, skipping insertion in model container [2018-01-20 22:25:25,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:25:25" (3/3) ... [2018-01-20 22:25:25,284 INFO L105 eAbstractionObserver]: Analyzing ICFG list_flag_true-unreach-call_false-valid-memtrack.i [2018-01-20 22:25:25,290 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:25:25,295 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 22:25:25,338 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:25:25,338 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:25:25,338 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:25:25,338 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:25:25,338 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:25:25,338 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:25:25,338 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:25:25,339 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-20 22:25:25,339 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:25:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:25:25,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:25:25,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 49 states. [2018-01-20 22:25:25,456 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-20 22:25:25,456 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-20 22:25:25,457 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-20 22:25:25,457 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-20 22:25:25,457 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-20 22:25:25,457 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 653) no Hoare annotation was computed. [2018-01-20 22:25:25,457 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 653) no Hoare annotation was computed. [2018-01-20 22:25:25,457 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 653) the Hoare annotation is: true [2018-01-20 22:25:25,457 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 653) no Hoare annotation was computed. [2018-01-20 22:25:25,458 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 653) the Hoare annotation is: true [2018-01-20 22:25:25,458 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 653) no Hoare annotation was computed. [2018-01-20 22:25:25,458 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 653) the Hoare annotation is: true [2018-01-20 22:25:25,458 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 653) no Hoare annotation was computed. [2018-01-20 22:25:25,458 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 653) no Hoare annotation was computed. [2018-01-20 22:25:25,459 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-20 22:25:25,459 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-20 22:25:25,459 INFO L404 ceAbstractionStarter]: At program point L649'''(lines 649 650) the Hoare annotation is: true [2018-01-20 22:25:25,459 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-20 22:25:25,459 INFO L401 ceAbstractionStarter]: For program point L647'(line 647) no Hoare annotation was computed. [2018-01-20 22:25:25,459 INFO L404 ceAbstractionStarter]: At program point L639'(line 639) the Hoare annotation is: true [2018-01-20 22:25:25,460 INFO L401 ceAbstractionStarter]: For program point L639'''(line 639) no Hoare annotation was computed. [2018-01-20 22:25:25,460 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-20 22:25:25,460 INFO L401 ceAbstractionStarter]: For program point L651''(lines 651 652) no Hoare annotation was computed. [2018-01-20 22:25:25,460 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-20 22:25:25,460 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-20 22:25:25,460 INFO L404 ceAbstractionStarter]: At program point L646'''(lines 646 647) the Hoare annotation is: true [2018-01-20 22:25:25,460 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 626 653) no Hoare annotation was computed. [2018-01-20 22:25:25,460 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 626 653) the Hoare annotation is: true [2018-01-20 22:25:25,460 INFO L401 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-20 22:25:25,461 INFO L401 ceAbstractionStarter]: For program point L632'(lines 632 642) no Hoare annotation was computed. [2018-01-20 22:25:25,461 INFO L404 ceAbstractionStarter]: At program point L632'''(lines 632 642) the Hoare annotation is: true [2018-01-20 22:25:25,461 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-20 22:25:25,461 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-20 22:25:25,461 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-20 22:25:25,461 INFO L401 ceAbstractionStarter]: For program point L645(lines 645 650) no Hoare annotation was computed. [2018-01-20 22:25:25,461 INFO L401 ceAbstractionStarter]: For program point L632''''(lines 632 642) no Hoare annotation was computed. [2018-01-20 22:25:25,462 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-20 22:25:25,462 INFO L401 ceAbstractionStarter]: For program point L649(lines 649 650) no Hoare annotation was computed. [2018-01-20 22:25:25,462 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-20 22:25:25,462 INFO L401 ceAbstractionStarter]: For program point L646(lines 646 647) no Hoare annotation was computed. [2018-01-20 22:25:25,462 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-20 22:25:25,462 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-20 22:25:25,463 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 626 653) no Hoare annotation was computed. [2018-01-20 22:25:25,463 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-20 22:25:25,463 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-20 22:25:25,463 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 637) no Hoare annotation was computed. [2018-01-20 22:25:25,463 INFO L401 ceAbstractionStarter]: For program point L632(lines 632 642) no Hoare annotation was computed. [2018-01-20 22:25:25,463 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-20 22:25:25,463 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-20 22:25:25,464 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-20 22:25:25,464 INFO L401 ceAbstractionStarter]: For program point L646'(line 646) no Hoare annotation was computed. [2018-01-20 22:25:25,464 INFO L401 ceAbstractionStarter]: For program point L649''''(lines 649 650) no Hoare annotation was computed. [2018-01-20 22:25:25,468 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:25:25,468 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:25:25,468 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:25:25,468 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:25:25,468 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:25:25,469 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:25:25,469 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:25:25,469 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:25:25,469 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:25:25,471 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:25:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:25:25,472 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:25,473 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:25:25,473 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:25:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 139664, now seen corresponding path program 1 times [2018-01-20 22:25:25,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:25,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:25,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:25,495 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:25:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:25:25,547 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:25:25,553 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:25:25,558 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:25:25,558 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:25:25,559 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:25:25,559 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:25:25,559 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:25:25,559 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:25:25,559 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:25:25,559 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:25:25,559 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:25:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:25:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 22:25:25,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:25,564 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:25,564 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1574628710, now seen corresponding path program 1 times [2018-01-20 22:25:25,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:25,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:25,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:25,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:25,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:25:25,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:25:25,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:25:25,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:25:25,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:25:25,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:25:25,648 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-20 22:25:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:25,736 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2018-01-20 22:25:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:25:25,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-20 22:25:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:25,745 INFO L225 Difference]: With dead ends: 71 [2018-01-20 22:25:25,746 INFO L226 Difference]: Without dead ends: 41 [2018-01-20 22:25:25,748 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:25:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-20 22:25:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-20 22:25:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-20 22:25:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-20 22:25:25,778 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-01-20 22:25:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:25,778 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-20 22:25:25,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:25:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-20 22:25:25,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 22:25:25,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:25,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:25,780 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash 456771048, now seen corresponding path program 1 times [2018-01-20 22:25:25,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:25,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:25,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:25,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:25,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:25:25,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:25:25,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 22:25:25,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 22:25:25,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 22:25:25,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 22:25:25,878 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 4 states. [2018-01-20 22:25:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:25,952 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-01-20 22:25:25,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 22:25:25,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-20 22:25:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:25,955 INFO L225 Difference]: With dead ends: 67 [2018-01-20 22:25:25,955 INFO L226 Difference]: Without dead ends: 48 [2018-01-20 22:25:25,956 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-20 22:25:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-20 22:25:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-20 22:25:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-20 22:25:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-20 22:25:25,963 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 24 [2018-01-20 22:25:25,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:25,963 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-20 22:25:25,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 22:25:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-20 22:25:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 22:25:25,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:25,965 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:25,965 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 590533786, now seen corresponding path program 1 times [2018-01-20 22:25:25,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:25,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:25,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:25,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:25,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:26,141 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-20 22:25:26,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:25:26,142 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:25:26,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:26,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:25:26,247 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:26,270 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:26,324 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-20 22:25:26,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:25:26,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-01-20 22:25:26,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-20 22:25:26,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-20 22:25:26,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=21, Unknown=2, NotChecked=18, Total=56 [2018-01-20 22:25:26,346 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 8 states. [2018-01-20 22:25:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:26,545 INFO L93 Difference]: Finished difference Result 97 states and 109 transitions. [2018-01-20 22:25:26,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-20 22:25:26,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-20 22:25:26,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:26,547 INFO L225 Difference]: With dead ends: 97 [2018-01-20 22:25:26,548 INFO L226 Difference]: Without dead ends: 69 [2018-01-20 22:25:26,549 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=46, Unknown=5, NotChecked=30, Total=110 [2018-01-20 22:25:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-20 22:25:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2018-01-20 22:25:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 22:25:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-01-20 22:25:26,557 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 35 [2018-01-20 22:25:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:26,557 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-01-20 22:25:26,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-20 22:25:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-01-20 22:25:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:25:26,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:26,559 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:26,559 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1507196248, now seen corresponding path program 2 times [2018-01-20 22:25:26,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:26,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:26,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:26,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:26,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:26,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:25:26,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:25:26,800 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:25:26,806 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:25:26,827 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:25:26,839 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:25:26,841 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:25:26,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:25:26,867 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:26,896 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (and (= (select .cse0 |main_#t~malloc5.base|) 0) (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))) is different from true [2018-01-20 22:25:26,926 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_1 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc1.base| 1))) (let ((.cse1 (store .cse0 v_prenex_1 1))) (and (= (select .cse0 v_prenex_1) 0) (= (select .cse1 |main_#t~malloc5.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store .cse1 |main_#t~malloc5.base| 1)))))) is different from true [2018-01-20 22:25:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2018-01-20 22:25:27,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:25:27,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2018-01-20 22:25:27,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 22:25:27,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 22:25:27,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=41, Unknown=3, NotChecked=42, Total=110 [2018-01-20 22:25:27,008 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 11 states. [2018-01-20 22:25:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:27,244 INFO L93 Difference]: Finished difference Result 161 states and 182 transitions. [2018-01-20 22:25:27,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-20 22:25:27,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-01-20 22:25:27,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:27,247 INFO L225 Difference]: With dead ends: 161 [2018-01-20 22:25:27,247 INFO L226 Difference]: Without dead ends: 104 [2018-01-20 22:25:27,248 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=93, Unknown=4, NotChecked=66, Total=210 [2018-01-20 22:25:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-20 22:25:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2018-01-20 22:25:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-20 22:25:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-01-20 22:25:27,259 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 46 [2018-01-20 22:25:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:27,259 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-01-20 22:25:27,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 22:25:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-01-20 22:25:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-20 22:25:27,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:27,261 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:27,262 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1698580536, now seen corresponding path program 1 times [2018-01-20 22:25:27,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:27,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:27,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:27,263 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:25:27,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:27,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-01-20 22:25:27,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:25:27,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:25:27,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:25:27,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:25:27,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:25:27,316 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2018-01-20 22:25:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:27,352 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2018-01-20 22:25:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:25:27,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-01-20 22:25:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:27,357 INFO L225 Difference]: With dead ends: 190 [2018-01-20 22:25:27,357 INFO L226 Difference]: Without dead ends: 137 [2018-01-20 22:25:27,358 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:25:27,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-20 22:25:27,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-01-20 22:25:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-20 22:25:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-01-20 22:25:27,372 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 68 [2018-01-20 22:25:27,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:27,372 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-01-20 22:25:27,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:25:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-01-20 22:25:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-20 22:25:27,374 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:27,374 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:27,374 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:27,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1820830472, now seen corresponding path program 2 times [2018-01-20 22:25:27,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:27,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:27,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:27,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:27,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:27,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-20 22:25:27,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:25:27,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 22:25:27,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 22:25:27,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 22:25:27,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:25:27,427 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 3 states. [2018-01-20 22:25:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:27,444 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2018-01-20 22:25:27,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 22:25:27,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-01-20 22:25:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:27,445 INFO L225 Difference]: With dead ends: 183 [2018-01-20 22:25:27,445 INFO L226 Difference]: Without dead ends: 137 [2018-01-20 22:25:27,446 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 22:25:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-20 22:25:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-01-20 22:25:27,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-20 22:25:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2018-01-20 22:25:27,458 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 68 [2018-01-20 22:25:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:27,458 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2018-01-20 22:25:27,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 22:25:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-01-20 22:25:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-20 22:25:27,460 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:27,460 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:27,460 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1039035672, now seen corresponding path program 1 times [2018-01-20 22:25:27,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:27,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:27,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:27,461 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:25:27,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:27,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:25:28,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:25:28,981 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:25:28,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:29,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:25:29,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:25:29,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:25:29,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-01-20 22:25:29,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-01-20 22:25:29,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-01-20 22:25:29,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:25:29,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2018-01-20 22:25:29,404 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~p~6.base 1))) (and (= (select |c_old(#valid)| main_~p~6.base) 0) (= (select .cse0 |c_main_#t~mem7.base|) 0) (= (store .cse0 |c_main_#t~mem7.base| 1) |c_#valid|)))) is different from true [2018-01-20 22:25:29,409 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= |c_#valid| (store .cse0 c_main_~p~6.base 1)) (= 0 (select .cse0 c_main_~p~6.base)) (= (select |c_old(#valid)| v_subst_1) 0)))) is different from true [2018-01-20 22:25:29,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:25:29,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:25:29,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:25:29,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:49 [2018-01-20 22:25:29,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-20 22:25:29,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2018-01-20 22:25:29,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:29,638 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-20 22:25:29,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:37 [2018-01-20 22:25:29,647 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse0 (store .cse1 main_~p~6.base 1))) (and (= (select .cse0 |c_main_#t~mem7.base|) 0) (= 0 (select .cse1 main_~p~6.base)) (= |c_#valid| (store .cse0 |c_main_#t~mem7.base| 1)) (= (select |c_old(#valid)| v_subst_1) 0))))) is different from true [2018-01-20 22:25:29,652 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse0 (store .cse1 v_subst_2 1))) (and (= |c_#valid| (store .cse0 main_~p~6.base 1)) (= 0 (select .cse1 v_subst_2)) (= (select |c_old(#valid)| v_subst_1) 0) (= 0 (select .cse0 main_~p~6.base)))))) is different from true [2018-01-20 22:25:29,671 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse0 (store .cse1 v_subst_2 1))) (and (= |c_#valid| (store (store .cse0 main_~p~6.base 1) |main_#t~malloc5.base| 1)) (= 0 (select .cse1 v_subst_2)) (= (select |c_old(#valid)| v_subst_1) 0) (= 0 (select .cse0 main_~p~6.base)))))) is different from true [2018-01-20 22:25:29,695 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_subst_2 Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (let ((.cse1 (store .cse0 v_subst_2 1))) (and (= 0 (select .cse0 v_subst_2)) (= (store (store (store .cse1 main_~p~6.base 1) v_prenex_2 1) |main_#t~malloc5.base| 1) |c_#valid|) (= (select |c_old(#valid)| v_subst_1) 0) (= 0 (select .cse1 main_~p~6.base)))))) is different from true [2018-01-20 22:25:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 74 not checked. [2018-01-20 22:25:29,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:25:29,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 39 [2018-01-20 22:25:29,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-20 22:25:29,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-20 22:25:29,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=876, Unknown=6, NotChecked=402, Total=1482 [2018-01-20 22:25:29,771 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 39 states. [2018-01-20 22:25:30,838 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 81 DAG size of output 70 [2018-01-20 22:25:31,022 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 76 DAG size of output 65 [2018-01-20 22:25:31,285 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 86 DAG size of output 75 [2018-01-20 22:25:31,704 WARN L146 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 106 DAG size of output 94 [2018-01-20 22:25:32,036 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 120 DAG size of output 107 [2018-01-20 22:25:33,356 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 89 DAG size of output 85 [2018-01-20 22:25:33,532 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 101 DAG size of output 75 [2018-01-20 22:25:34,217 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 93 DAG size of output 67 [2018-01-20 22:25:34,494 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 121 DAG size of output 86 [2018-01-20 22:25:34,761 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 135 DAG size of output 96 [2018-01-20 22:25:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:35,813 INFO L93 Difference]: Finished difference Result 198 states and 207 transitions. [2018-01-20 22:25:35,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-20 22:25:35,813 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 68 [2018-01-20 22:25:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:35,814 INFO L225 Difference]: With dead ends: 198 [2018-01-20 22:25:35,815 INFO L226 Difference]: Without dead ends: 175 [2018-01-20 22:25:35,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1083, Invalid=4572, Unknown=69, NotChecked=918, Total=6642 [2018-01-20 22:25:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-20 22:25:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 161. [2018-01-20 22:25:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-20 22:25:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2018-01-20 22:25:35,833 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 68 [2018-01-20 22:25:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:35,834 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2018-01-20 22:25:35,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-20 22:25:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2018-01-20 22:25:35,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:25:35,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:35,836 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:35,836 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1491371238, now seen corresponding path program 3 times [2018-01-20 22:25:35,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:35,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:35,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:35,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:35,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:35,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:25:37,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:25:37,510 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:25:37,514 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:25:37,526 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:25:37,530 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:25:37,535 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:25:37,554 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:25:37,582 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:25:37,631 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:25:37,634 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:25:37,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:25:37,641 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:37,652 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:37,663 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (and (= (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) |main_#t~malloc5.base| 1) |c_#valid|) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:37,674 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1))) (and (= (select .cse0 |c_main_#t~malloc5.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (store .cse0 |c_main_#t~malloc5.base| 1) |c_#valid|)))) is different from true [2018-01-20 22:25:37,677 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1))) (and (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (store .cse0 c_main_~t~6.base 1) |c_#valid|) (= (select .cse0 c_main_~t~6.base) 0)))) is different from true [2018-01-20 22:25:37,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:25:37,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:25:37,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,694 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-20 22:25:37,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:47 [2018-01-20 22:25:37,697 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)))) (and (= |c_#valid| (store .cse0 .cse1 1)) (= (select .cse0 .cse1) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))) is different from true [2018-01-20 22:25:37,701 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-20 22:25:37,703 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-20 22:25:37,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:25:37,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:56, output treesize:35 [2018-01-20 22:25:37,723 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1))) (and (= 0 (select .cse0 |c_main_#t~mem7.base|)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store .cse0 |c_main_#t~mem7.base| 1))))) is different from true [2018-01-20 22:25:37,728 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1))) (and (= (store .cse0 c_main_~p~6.base 1) |c_#valid|) (= (select .cse0 c_main_~p~6.base) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))) is different from true [2018-01-20 22:25:37,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:25:37,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:25:37,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,822 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-20 22:25:37,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:67 [2018-01-20 22:25:37,863 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 57 treesize of output 51 [2018-01-20 22:25:37,867 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 51 treesize of output 36 [2018-01-20 22:25:37,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:37,879 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-20 22:25:37,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:55 [2018-01-20 22:25:37,882 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (main_~p~6.base Int) (|main_#t~malloc1.base| Int)) (let ((.cse1 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1))) (let ((.cse0 (store .cse1 main_~p~6.base 1))) (and (= |c_#valid| (store .cse0 |c_main_#t~mem7.base| 1)) (= 0 (select .cse0 |c_main_#t~mem7.base|)) (= (select .cse1 main_~p~6.base) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-20 22:25:37,885 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (main_~p~6.base Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1))) (let ((.cse1 (store .cse0 v_subst_3 1))) (and (= (select .cse0 v_subst_3) 0) (= 0 (select .cse1 main_~p~6.base)) (= (store .cse1 main_~p~6.base 1) |c_#valid|) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-20 22:25:37,894 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_4 Int) (v_prenex_3 Int) (main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_subst_3 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_3 1) v_prenex_4 1))) (let ((.cse1 (store .cse0 v_subst_3 1))) (let ((.cse2 (store .cse1 main_~p~6.base 1))) (and (= (select .cse0 v_subst_3) 0) (= 0 (select .cse1 main_~p~6.base)) (= (store .cse2 |main_#t~malloc5.base| 1) |c_#valid|) (= 0 (select .cse2 |main_#t~malloc5.base|)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))))) is different from true [2018-01-20 22:25:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 125 not checked. [2018-01-20 22:25:38,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:25:38,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-01-20 22:25:38,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-20 22:25:38,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-20 22:25:38,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=250, Unknown=11, NotChecked=462, Total=812 [2018-01-20 22:25:38,004 INFO L87 Difference]: Start difference. First operand 161 states and 166 transitions. Second operand 29 states. [2018-01-20 22:25:40,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:40,341 INFO L93 Difference]: Finished difference Result 266 states and 280 transitions. [2018-01-20 22:25:40,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-20 22:25:40,341 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-01-20 22:25:40,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:40,343 INFO L225 Difference]: With dead ends: 266 [2018-01-20 22:25:40,343 INFO L226 Difference]: Without dead ends: 205 [2018-01-20 22:25:40,344 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=293, Invalid=1204, Unknown=29, NotChecked=924, Total=2450 [2018-01-20 22:25:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-20 22:25:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2018-01-20 22:25:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-20 22:25:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2018-01-20 22:25:40,361 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 79 [2018-01-20 22:25:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:40,361 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2018-01-20 22:25:40,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-20 22:25:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2018-01-20 22:25:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-20 22:25:40,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:40,362 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:40,362 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:25:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1252800966, now seen corresponding path program 2 times [2018-01-20 22:25:40,362 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:40,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:40,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:40,363 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:25:40,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:40,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:53,573 WARN L146 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-01-20 22:25:53,950 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 61 DAG size of output 49 [2018-01-20 22:25:55,361 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 30 DAG size of output 22 [2018-01-20 22:25:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:25:55,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:25:55,635 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:25:55,640 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:25:55,656 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:25:55,671 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:25:55,683 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:25:55,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:25:55,693 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc1.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:55,700 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (and (= |c_#valid| (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))) is different from true [2018-01-20 22:25:55,710 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (select .cse0 |main_#t~malloc5.base|) 0)))) is different from true [2018-01-20 22:25:55,727 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse1 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse0 (store .cse1 v_prenex_6 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= (select .cse1 v_prenex_6) 0) (= 0 (select .cse0 |main_#t~malloc5.base|)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-20 22:25:55,748 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (and (= (select .cse0 v_prenex_6) 0) (= 0 (select .cse1 v_prenex_7)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= (store (store .cse1 v_prenex_7 1) |c_main_#t~malloc5.base| 1) |c_#valid|))))) is different from true [2018-01-20 22:25:55,753 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (and (= (select .cse0 v_prenex_6) 0) (= |c_#valid| (store (store .cse1 v_prenex_7 1) c_main_~t~6.base 1)) (= 0 (select .cse1 v_prenex_7)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-20 22:25:55,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:25:55,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:25:55,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,776 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-20 22:25:55,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:55 [2018-01-20 22:25:55,780 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (and (= (select .cse0 v_prenex_6) 0) (= 0 (select .cse1 v_prenex_7)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store (store .cse1 v_prenex_7 1) (select (select |c_#memory_$Pointer$.base| c_main_~p~6.base) (+ c_main_~p~6.offset 4)) 1)))))) is different from true [2018-01-20 22:25:55,784 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-20 22:25:55,786 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-20 22:25:55,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-20 22:25:55,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:64, output treesize:49 [2018-01-20 22:25:55,796 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (and (= (select .cse0 v_prenex_6) 0) (= (store (store .cse1 v_prenex_7 1) |c_main_#t~mem7.base| 1) |c_#valid|) (= 0 (select .cse1 v_prenex_7)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-20 22:25:55,799 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (main_~p~6.base Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (and (= (select .cse0 v_prenex_6) 0) (= |c_#valid| (store (store .cse1 v_prenex_7 1) main_~p~6.base 1)) (= 0 (select .cse1 v_prenex_7)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-20 22:25:55,808 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (main_~p~6.base Int) (|main_#t~malloc5.base| Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (and (= (select .cse0 v_prenex_6) 0) (= 0 (select .cse1 v_prenex_7)) (= (store (store (store .cse1 v_prenex_7 1) main_~p~6.base 1) |main_#t~malloc5.base| 1) |c_#valid|) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0))))) is different from true [2018-01-20 22:25:55,827 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (main_~p~6.base Int) (v_prenex_8 Int) (|main_#t~malloc1.base| Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (let ((.cse2 (store (store (store .cse1 v_prenex_7 1) main_~p~6.base 1) v_prenex_8 1))) (and (= (select .cse0 v_prenex_6) 0) (= 0 (select .cse1 v_prenex_7)) (= (select .cse2 |c_main_#t~malloc5.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= |c_#valid| (store .cse2 |c_main_#t~malloc5.base| 1))))))) is different from true [2018-01-20 22:25:55,834 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (main_~p~6.base Int) (v_prenex_8 Int) (|main_#t~malloc1.base| Int)) (let ((.cse1 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse2 (store .cse1 v_prenex_6 1))) (let ((.cse0 (store (store (store .cse2 v_prenex_7 1) main_~p~6.base 1) v_prenex_8 1))) (and (= |c_#valid| (store .cse0 c_main_~t~6.base 1)) (= (select .cse1 v_prenex_6) 0) (= (select .cse0 c_main_~t~6.base) 0) (= 0 (select .cse2 v_prenex_7)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))))) is different from true [2018-01-20 22:25:55,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:25:55,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-20 22:25:55,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-20 22:25:55,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:91, output treesize:90 [2018-01-20 22:25:55,875 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_8 Int) (|main_#t~malloc1.base| Int) (v_prenex_9 Int)) (let ((.cse2 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse3 (store .cse2 v_prenex_6 1))) (let ((.cse0 (store (store (store .cse3 v_prenex_7 1) v_prenex_9 1) v_prenex_8 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)) (= (select .cse2 v_prenex_6) 0) (= 0 (select .cse3 v_prenex_7)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))))) is different from true [2018-01-20 22:25:55,879 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 69 treesize of output 63 [2018-01-20 22:25:55,882 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 63 treesize of output 48 [2018-01-20 22:25:55,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:25:55,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-20 22:25:55,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:99, output treesize:78 [2018-01-20 22:25:55,907 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_8 Int) (|main_#t~malloc1.base| Int) (v_prenex_9 Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse2 (store .cse0 v_prenex_6 1))) (let ((.cse1 (store (store (store .cse2 v_prenex_7 1) v_prenex_9 1) v_prenex_8 1))) (and (= (select .cse0 v_prenex_6) 0) (= (select .cse1 |c_main_#t~mem7.base|) 0) (= 0 (select .cse2 v_prenex_7)) (= |c_#valid| (store .cse1 |c_main_#t~mem7.base| 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0)))))) is different from true [2018-01-20 22:25:55,914 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (main_~p~6.base Int) (v_prenex_8 Int) (|main_#t~malloc1.base| Int) (v_prenex_9 Int)) (let ((.cse0 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse1 (store .cse0 v_prenex_6 1))) (let ((.cse2 (store (store (store .cse1 v_prenex_7 1) v_prenex_9 1) v_prenex_8 1))) (and (= (select .cse0 v_prenex_6) 0) (= 0 (select .cse1 v_prenex_7)) (= |c_#valid| (store .cse2 main_~p~6.base 1)) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= 0 (select .cse2 main_~p~6.base))))))) is different from true [2018-01-20 22:25:55,934 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (main_~p~6.base Int) (|main_#t~malloc5.base| Int) (v_prenex_8 Int) (|main_#t~malloc1.base| Int) (v_prenex_9 Int)) (let ((.cse1 (store (store |c_old(#valid)| |main_#t~malloc1.base| 1) v_prenex_5 1))) (let ((.cse2 (store .cse1 v_prenex_6 1))) (let ((.cse3 (store (store (store .cse2 v_prenex_7 1) v_prenex_9 1) v_prenex_8 1))) (let ((.cse0 (store .cse3 main_~p~6.base 1))) (and (= |c_#valid| (store .cse0 |main_#t~malloc5.base| 1)) (= (select .cse1 v_prenex_6) 0) (= 0 (select .cse2 v_prenex_7)) (= (select .cse0 |main_#t~malloc5.base|) 0) (= (select |c_old(#valid)| |main_#t~malloc1.base|) 0) (= 0 (select .cse3 main_~p~6.base)))))))) is different from true [2018-01-20 22:25:56,025 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 252 not checked. [2018-01-20 22:25:56,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:25:56,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-01-20 22:25:56,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-20 22:25:56,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-20 22:25:56,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=91, Unknown=16, NotChecked=560, Total=756 [2018-01-20 22:25:56,047 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 28 states. [2018-01-20 22:25:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:56,834 INFO L93 Difference]: Finished difference Result 219 states and 225 transitions. [2018-01-20 22:25:56,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-20 22:25:56,834 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 101 [2018-01-20 22:25:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:56,835 INFO L225 Difference]: With dead ends: 219 [2018-01-20 22:25:56,835 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 22:25:56,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 110 SyntacticMatches, 24 SemanticMatches, 42 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=273, Invalid=387, Unknown=160, NotChecked=1072, Total=1892 [2018-01-20 22:25:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 22:25:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 22:25:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 22:25:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 22:25:56,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-01-20 22:25:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:56,837 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 22:25:56,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-20 22:25:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 22:25:56,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 22:25:56,839 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:25:56,839 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:25:56,839 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:25:56,840 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:25:56,840 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:25:56,840 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:25:56,840 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:25:56,840 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:25:56,840 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:25:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-20 22:25:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 22:25:56,842 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:56,842 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:56,842 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:25:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1002754735, now seen corresponding path program 1 times [2018-01-20 22:25:56,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:56,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:56,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:56,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:56,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:25:56,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:25:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:25:56,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:25:56,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:25:56,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:25:56,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:25:56,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:25:56,852 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-20 22:25:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:25:56,855 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2018-01-20 22:25:56,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:25:56,855 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 22:25:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:25:56,856 INFO L225 Difference]: With dead ends: 71 [2018-01-20 22:25:56,856 INFO L226 Difference]: Without dead ends: 39 [2018-01-20 22:25:56,856 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:25:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-20 22:25:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-20 22:25:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-20 22:25:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-20 22:25:56,859 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-01-20 22:25:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:25:56,859 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-20 22:25:56,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:25:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-20 22:25:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-20 22:25:56,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:25:56,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:25:56,860 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:25:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1264327759, now seen corresponding path program 1 times [2018-01-20 22:25:56,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:25:56,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:25:56,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:56,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:25:56,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:25:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:25:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:25:56,875 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:25:56,879 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:25:56,882 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:25:56,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:25:56 BoogieIcfgContainer [2018-01-20 22:25:56,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:25:56,896 INFO L168 Benchmark]: Toolchain (without parser) took 32138.76 ms. Allocated memory was 305.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 264.0 MB in the beginning and 1.0 GB in the end (delta: -780.9 MB). Peak memory consumption was 385.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:25:56,897 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:25:56,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.23 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:25:56,898 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 305.7 MB. Free memory was 252.9 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:25:56,898 INFO L168 Benchmark]: RCFGBuilder took 274.52 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 232.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:25:56,899 INFO L168 Benchmark]: TraceAbstraction took 31615.59 ms. Allocated memory was 305.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 232.4 MB in the beginning and 1.0 GB in the end (delta: -812.5 MB). Peak memory consumption was 354.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:25:56,900 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.26 ms. Allocated memory is still 305.7 MB. Free memory is still 269.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.23 ms. Allocated memory is still 305.7 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 305.7 MB. Free memory was 252.9 MB in the beginning and 251.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 274.52 ms. Allocated memory is still 305.7 MB. Free memory was 251.0 MB in the beginning and 232.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 31615.59 ms. Allocated memory was 305.7 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 232.4 MB in the beginning and 1.0 GB in the end (delta: -812.5 MB). Peak memory consumption was 354.0 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, 52 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 10 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - 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, 52 locations, 4 error locations. SAFE Result, 31.2s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 503 SDtfs, 963 SDslu, 1821 SDs, 0 SdLazy, 1617 SolverSat, 201 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 332 SyntacticMatches, 30 SemanticMatches, 196 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 1920 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 58 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 838 NumberOfCodeBlocks, 838 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 824 ConstructedInterpolants, 271 QuantifiedInterpolants, 29111037 SizeOfPredicates, 63 NumberOfNonLiveVariables, 982 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 150/1100 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 = __VERIFIER_nondet_int(); [L628] List p, a, t; VAL [flag=1] [L629] EXPR, FCALL malloc(sizeof(struct node)) VAL [flag=1, malloc(sizeof(struct node))={10:0}] [L629] a = (List) malloc(sizeof(struct node)) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L630] COND FALSE !(a == 0) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}] [L631] p = a VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L632] COND FALSE !(__VERIFIER_nondet_int()) [L643] FCALL p->h = 3 VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L644] p = a VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L645] COND TRUE \read(flag) VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}] [L646] EXPR, FCALL p->h VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L646] COND FALSE !(p->h == 1) [L651] EXPR, FCALL p->h VAL [a={10:0}, flag=1, malloc(sizeof(struct node))={10:0}, p={10:0}, p->h=3] [L651] COND FALSE !(p->h != 3) - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 54 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=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 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: 646]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 649]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 632]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-25-56-911.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-25-56-911.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-25-56-911.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-25-56-911.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_flag_true-unreach-call_false-valid-memtrack.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_22-25-56-911.csv Received shutdown request...