java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:48:13,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:48:13,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:48:13,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:48:13,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:48:13,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:48:13,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:48:13,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:48:13,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:48:13,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:48:13,395 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:48:13,395 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:48:13,396 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:48:13,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:48:13,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:48:13,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:48:13,402 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:48:13,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:48:13,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:48:13,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:48:13,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:48:13,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:48:13,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:48:13,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:48:13,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:48:13,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:48:13,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:48:13,414 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:48:13,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:48:13,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:48:13,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:48:13,415 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:48:13,426 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:48:13,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:48:13,427 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:48:13,428 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:48:13,428 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:48:13,428 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:48:13,428 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:48:13,428 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:48:13,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:48:13,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:48:13,429 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:48:13,430 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:48:13,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:48:13,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:48:13,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:48:13,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:48:13,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:48:13,431 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:48:13,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:48:13,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:48:13,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:48:13,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:48:13,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:48:13,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:48:13,432 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:48:13,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:48:13,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:48:13,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:48:13,433 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:48:13,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:48:13,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:48:13,434 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:48:13,434 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:48:13,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:48:13,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:48:13,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:48:13,435 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:48:13,436 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:48:13,436 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:48:13,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:48:13,482 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:48:13,486 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:48:13,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:48:13,488 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:48:13,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-21 10:48:13,649 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:48:13,654 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:48:13,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:48:13,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:48:13,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:48:13,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167329f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13, skipping insertion in model container [2018-01-21 10:48:13,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,681 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:48:13,724 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:48:13,845 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:48:13,901 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:48:13,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13 WrapperNode [2018-01-21 10:48:13,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:48:13,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:48:13,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:48:13,910 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:48:13,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... [2018-01-21 10:48:13,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:48:13,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:48:13,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:48:13,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:48:13,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:48:14,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:48:14,010 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:48:14,011 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:48:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:48:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:48:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:48:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:48:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:48:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:48:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:48:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:48:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 10:48:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:48:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:48:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:48:14,441 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:48:14,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:48:14 BoogieIcfgContainer [2018-01-21 10:48:14,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:48:14,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:48:14,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:48:14,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:48:14,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:48:13" (1/3) ... [2018-01-21 10:48:14,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa243ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:48:14, skipping insertion in model container [2018-01-21 10:48:14,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:48:13" (2/3) ... [2018-01-21 10:48:14,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa243ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:48:14, skipping insertion in model container [2018-01-21 10:48:14,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:48:14" (3/3) ... [2018-01-21 10:48:14,454 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-01-21 10:48:14,462 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:48:14,470 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 10:48:14,511 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:48:14,511 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:48:14,512 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:48:14,512 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:48:14,512 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:48:14,512 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:48:14,512 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:48:14,512 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:48:14,513 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:48:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-21 10:48:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:48:14,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:14,537 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:48:14,538 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:48:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash 396895, now seen corresponding path program 1 times [2018-01-21 10:48:14,544 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:14,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:14,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:14,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:14,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:48:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:48:14,635 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:48:14,642 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:48:14,650 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:48:14,650 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:48:14,650 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:48:14,651 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:48:14,651 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:48:14,651 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:48:14,651 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:48:14,651 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:48:14,651 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:48:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-21 10:48:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 10:48:14,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:14,658 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-21 10:48:14,658 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:48:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1539010196, now seen corresponding path program 1 times [2018-01-21 10:48:14,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:14,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:14,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:14,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:14,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:48:14,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:48:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:48:14,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:48:14,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:48:14,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:48:14,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:48:14,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:48:14,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:48:14,819 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-21 10:48:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:48:14,850 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2018-01-21 10:48:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:48:14,851 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 10:48:14,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:48:14,863 INFO L225 Difference]: With dead ends: 244 [2018-01-21 10:48:14,863 INFO L226 Difference]: Without dead ends: 124 [2018-01-21 10:48:14,866 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:48:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-21 10:48:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-21 10:48:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-21 10:48:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-01-21 10:48:14,904 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 24 [2018-01-21 10:48:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:48:14,905 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-01-21 10:48:14,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:48:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-01-21 10:48:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:48:14,907 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:14,907 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:48:14,907 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:48:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash 849242386, now seen corresponding path program 1 times [2018-01-21 10:48:14,908 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:14,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:14,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:14,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:14,909 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:48:14,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:48:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:48:15,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:48:15,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:48:15,072 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:48:15,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:48:15,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:48:15,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:48:15,074 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-01-21 10:48:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:48:15,317 INFO L93 Difference]: Finished difference Result 287 states and 310 transitions. [2018-01-21 10:48:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 10:48:15,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-21 10:48:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:48:15,321 INFO L225 Difference]: With dead ends: 287 [2018-01-21 10:48:15,321 INFO L226 Difference]: Without dead ends: 192 [2018-01-21 10:48:15,322 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:48:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-21 10:48:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2018-01-21 10:48:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-21 10:48:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-21 10:48:15,331 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 37 [2018-01-21 10:48:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:48:15,331 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-21 10:48:15,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:48:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-21 10:48:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-21 10:48:15,332 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:15,333 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:48:15,333 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:48:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1513386891, now seen corresponding path program 1 times [2018-01-21 10:48:15,333 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:15,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:15,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,334 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:48:15,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:48:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:48:15,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:48:15,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:48:15,403 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:48:15,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:48:15,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:48:15,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:48:15,405 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 5 states. [2018-01-21 10:48:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:48:15,538 INFO L93 Difference]: Finished difference Result 213 states and 229 transitions. [2018-01-21 10:48:15,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:48:15,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-01-21 10:48:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:48:15,541 INFO L225 Difference]: With dead ends: 213 [2018-01-21 10:48:15,542 INFO L226 Difference]: Without dead ends: 186 [2018-01-21 10:48:15,542 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:48:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-21 10:48:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 132. [2018-01-21 10:48:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-21 10:48:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-01-21 10:48:15,555 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 39 [2018-01-21 10:48:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:48:15,555 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-01-21 10:48:15,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:48:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-01-21 10:48:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-21 10:48:15,558 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:15,558 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:48:15,558 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:48:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1547435689, now seen corresponding path program 1 times [2018-01-21 10:48:15,558 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:15,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:15,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:48:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:48:15,619 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:48:15,630 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:48:15,640 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:48:15,641 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:48:15,660 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:48:15,660 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:48:15,660 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:48:15,660 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:48:15,660 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:48:15,660 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:48:15,660 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:48:15,660 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:48:15,661 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:48:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-21 10:48:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 10:48:15,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:15,664 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-21 10:48:15,664 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:48:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 565995656, now seen corresponding path program 1 times [2018-01-21 10:48:15,664 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:15,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:15,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,666 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:48:15,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:48:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:48:15,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:48:15,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:48:15,681 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:48:15,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:48:15,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:48:15,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:48:15,681 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-21 10:48:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:48:15,688 INFO L93 Difference]: Finished difference Result 244 states and 348 transitions. [2018-01-21 10:48:15,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:48:15,688 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 10:48:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:48:15,689 INFO L225 Difference]: With dead ends: 244 [2018-01-21 10:48:15,689 INFO L226 Difference]: Without dead ends: 122 [2018-01-21 10:48:15,691 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:48:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-21 10:48:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-21 10:48:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-21 10:48:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-21 10:48:15,699 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 22 [2018-01-21 10:48:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:48:15,699 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-21 10:48:15,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:48:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-21 10:48:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 10:48:15,700 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:15,700 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:48:15,701 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:48:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -673975890, now seen corresponding path program 1 times [2018-01-21 10:48:15,701 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:15,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:15,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:48:15,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:48:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:48:15,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:48:15,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:48:15,776 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:48:15,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:48:15,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:48:15,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:48:15,778 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 5 states. [2018-01-21 10:48:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:48:15,915 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-01-21 10:48:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 10:48:15,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-21 10:48:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:48:15,918 INFO L225 Difference]: With dead ends: 283 [2018-01-21 10:48:15,918 INFO L226 Difference]: Without dead ends: 190 [2018-01-21 10:48:15,919 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:48:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-21 10:48:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 126. [2018-01-21 10:48:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-21 10:48:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-21 10:48:15,928 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 35 [2018-01-21 10:48:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:48:15,929 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-21 10:48:15,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:48:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-21 10:48:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:48:15,931 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:15,931 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:48:15,931 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:48:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1839763921, now seen corresponding path program 1 times [2018-01-21 10:48:15,931 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:15,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:15,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:15,933 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:48:15,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:48:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:48:16,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:48:16,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:48:16,038 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:48:16,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:48:16,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:48:16,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:48:16,039 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 5 states. [2018-01-21 10:48:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:48:16,123 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2018-01-21 10:48:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:48:16,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-21 10:48:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:48:16,125 INFO L225 Difference]: With dead ends: 209 [2018-01-21 10:48:16,126 INFO L226 Difference]: Without dead ends: 184 [2018-01-21 10:48:16,126 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:48:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-01-21 10:48:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 130. [2018-01-21 10:48:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-21 10:48:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2018-01-21 10:48:16,135 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 37 [2018-01-21 10:48:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:48:16,136 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2018-01-21 10:48:16,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:48:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2018-01-21 10:48:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-21 10:48:16,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:48:16,137 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:48:16,138 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:48:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash 171442437, now seen corresponding path program 1 times [2018-01-21 10:48:16,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:48:16,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:16,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:48:16,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:48:16,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:48:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:48:16,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:48:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:48:16,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:48:16,312 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:48:16,313 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-01-21 10:48:16,315 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [8], [9], [10], [14], [19], [23], [29], [32], [33], [47], [48], [49], [54], [55], [56], [62], [66], [72], [76], [78], [81], [173], [177], [182], [186], [194], [198], [200], [201], [202], [206], [210], [279], [284], [288], [294], [295], [301], [305], [307], [308], [309], [370], [372], [373], [374], [375], [379], [381], [382], [383], [384] [2018-01-21 10:48:16,361 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:48:16,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-21 10:49:19,950 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-21 10:49:19,950 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-21 10:49:19,969 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:49:19,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:49:19,970 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:49:20,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:49:20,002 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:49:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:49:20,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:49:20,055 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 10:49:20,055 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:49:20,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:49:20 BoogieIcfgContainer [2018-01-21 10:49:20,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:49:20,059 INFO L168 Benchmark]: Toolchain (without parser) took 66409.30 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 260.4 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 372.7 MB. Max. memory is 5.3 GB. [2018-01-21 10:49:20,061 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 301.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:49:20,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.05 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 246.4 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-21 10:49:20,061 INFO L168 Benchmark]: Boogie Preprocessor took 43.22 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:49:20,062 INFO L168 Benchmark]: RCFGBuilder took 489.35 ms. Allocated memory is still 301.5 MB. Free memory was 244.4 MB in the beginning and 211.5 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. [2018-01-21 10:49:20,062 INFO L168 Benchmark]: TraceAbstraction took 65611.51 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 211.5 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 323.8 MB. Max. memory is 5.3 GB. [2018-01-21 10:49:20,064 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.17 ms. Allocated memory is still 301.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 254.05 ms. Allocated memory is still 301.5 MB. Free memory was 260.4 MB in the beginning and 246.4 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.22 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 489.35 ms. Allocated memory is still 301.5 MB. Free memory was 244.4 MB in the beginning and 211.5 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65611.51 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 211.5 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 323.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 3 procedures, 127 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L992] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={14:0}] [L992] SLL* list = malloc(sizeof(SLL)); VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L993] FCALL list->next = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L994] FCALL list->prev = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list != ((void*)0))) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] COND TRUE __VERIFIER_nondet_int() [L995] FCALL list->inner = ((void*)0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={0:0}, malloc(sizeof(SLL))={14:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={14:0}] [L995] EXPR, FCALL list->inner VAL [list={14:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={14:0}] [L995] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={14:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={14:0}] [L995] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] COND FALSE !(0) VAL [list={14:0}, malloc(sizeof(SLL))={14:0}] [L997] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1011] end = ((void*)0) [L1012] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1015] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1017] COND TRUE ((void*)0) != end [L1019] int len = 0; VAL [end={14:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1020] EXPR, FCALL end->inner VAL [end={14:0}, end->inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1020] SLL* inner = end->inner; [L1021] COND FALSE !(((void*)0) != inner) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND FALSE !(!(len <= 1)) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND FALSE !(0) VAL [end={14:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->next VAL [end={14:0}, end->next={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1034] end = end->next [L1017] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1038] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1040] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, list->inner={0:0}, malloc(sizeof(SLL))={14:0}] [L1040] end = list->inner [L1042] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1050] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, list->next={0:0}, malloc(sizeof(SLL))={14:0}] [L1050] end = list->next [L1051] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1052] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={14:0}] [L1038] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={14:0}] [L1055] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 127 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 357 SDtfs, 432 SDslu, 434 SDs, 0 SdLazy, 175 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=3, 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, 3 MinimizatonAttempts, 118 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 7895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 127 locations, 3 error locations. TIMEOUT Result, 64.3s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 353 SDtfs, 432 SDslu, 423 SDs, 0 SdLazy, 174 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 63.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 118 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 7271 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-49-20-074.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-49-20-074.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-49-20-074.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-49-20-074.csv Completed graceful shutdown