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_preciseopt.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 09:10:49,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 09:10:49,969 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 09:10:49,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 09:10:49,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 09:10:49,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 09:10:49,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 09:10:49,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 09:10:49,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 09:10:49,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 09:10:49,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 09:10:49,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 09:10:49,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 09:10:49,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 09:10:49,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 09:10:49,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 09:10:50,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 09:10:50,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 09:10:50,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 09:10:50,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 09:10:50,006 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 09:10:50,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 09:10:50,007 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 09:10:50,008 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 09:10:50,009 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 09:10:50,010 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 09:10:50,010 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 09:10:50,011 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 09:10:50,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 09:10:50,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 09:10:50,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 09:10:50,012 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_preciseopt.epf [2018-01-21 09:10:50,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 09:10:50,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 09:10:50,021 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 09:10:50,021 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 09:10:50,022 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 09:10:50,022 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 09:10:50,022 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 09:10:50,022 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 09:10:50,022 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 09:10:50,023 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 09:10:50,023 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 09:10:50,023 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 09:10:50,023 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 09:10:50,023 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 09:10:50,023 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 09:10:50,024 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 09:10:50,024 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 09:10:50,024 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 09:10:50,024 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 09:10:50,024 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 09:10:50,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 09:10:50,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 09:10:50,025 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 09:10:50,025 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 09:10:50,025 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 09:10:50,025 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 09:10:50,025 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 09:10:50,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 09:10:50,026 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 09:10:50,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 09:10:50,027 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 09:10:50,027 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 09:10:50,027 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 09:10:50,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 09:10:50,074 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 09:10:50,077 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 09:10:50,078 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 09:10:50,078 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 09:10:50,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-21 09:10:50,251 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 09:10:50,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 09:10:50,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 09:10:50,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 09:10:50,260 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 09:10:50,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,263 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 09:10:50, skipping insertion in model container [2018-01-21 09:10:50,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,276 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 09:10:50,316 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 09:10:50,439 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 09:10:50,462 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 09:10:50,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50 WrapperNode [2018-01-21 09:10:50,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 09:10:50,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 09:10:50,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 09:10:50,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 09:10:50,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (1/1) ... [2018-01-21 09:10:50,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 09:10:50,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 09:10:50,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 09:10:50,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 09:10:50,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (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 09:10:50,578 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 09:10:50,579 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 09:10:50,579 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 09:10:50,579 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 09:10:50,579 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 09:10:50,579 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 09:10:50,579 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 09:10:50,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 09:10:50,580 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 09:10:50,580 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 09:10:50,580 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 09:10:50,580 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 09:10:50,580 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 09:10:50,581 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 09:10:50,581 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 09:10:50,581 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 09:10:50,581 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 09:10:50,956 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 09:10:50,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 09:10:50 BoogieIcfgContainer [2018-01-21 09:10:50,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 09:10:50,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 09:10:50,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 09:10:50,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 09:10:50,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 09:10:50" (1/3) ... [2018-01-21 09:10:50,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bd672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 09:10:50, skipping insertion in model container [2018-01-21 09:10:50,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 09:10:50" (2/3) ... [2018-01-21 09:10:50,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37bd672f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 09:10:50, skipping insertion in model container [2018-01-21 09:10:50,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 09:10:50" (3/3) ... [2018-01-21 09:10:50,962 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-optional_true-unreach-call_true-valid-memsafety.i [2018-01-21 09:10:50,968 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 09:10:50,974 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 09:10:51,018 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 09:10:51,018 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 09:10:51,018 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 09:10:51,018 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 09:10:51,018 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 09:10:51,019 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 09:10:51,019 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 09:10:51,019 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 09:10:51,019 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 09:10:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 09:10:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 09:10:51,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:51,041 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 09:10:51,041 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 09:10:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash 195400, now seen corresponding path program 1 times [2018-01-21 09:10:51,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:51,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:51,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,088 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 09:10:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 09:10:51,144 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 09:10:51,152 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 09:10:51,159 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 09:10:51,159 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 09:10:51,159 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 09:10:51,159 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 09:10:51,159 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 09:10:51,159 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 09:10:51,159 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 09:10:51,159 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 09:10:51,159 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 09:10:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 09:10:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 09:10:51,163 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:51,163 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 09:10:51,163 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 09:10:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash 499029481, now seen corresponding path program 1 times [2018-01-21 09:10:51,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:51,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:51,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:10:51,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 09:10:51,318 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 09:10:51,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 09:10:51,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 09:10:51,320 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 09:10:51,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 09:10:51,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 09:10:51,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 09:10:51,345 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-21 09:10:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 09:10:51,367 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-01-21 09:10:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 09:10:51,369 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 09:10:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 09:10:51,382 INFO L225 Difference]: With dead ends: 124 [2018-01-21 09:10:51,382 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 09:10:51,386 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 09:10:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 09:10:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-21 09:10:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-21 09:10:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-21 09:10:51,423 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 23 [2018-01-21 09:10:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 09:10:51,423 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-21 09:10:51,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 09:10:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-21 09:10:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 09:10:51,424 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:51,424 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 09:10:51,424 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 09:10:51,425 INFO L82 PathProgramCache]: Analyzing trace with hash -245872207, now seen corresponding path program 1 times [2018-01-21 09:10:51,425 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:51,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:51,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,426 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:10:51,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 09:10:51,526 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 09:10:51,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 09:10:51,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 09:10:51,527 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 09:10:51,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 09:10:51,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 09:10:51,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 09:10:51,529 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 5 states. [2018-01-21 09:10:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 09:10:51,727 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2018-01-21 09:10:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 09:10:51,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-01-21 09:10:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 09:10:51,730 INFO L225 Difference]: With dead ends: 141 [2018-01-21 09:10:51,731 INFO L226 Difference]: Without dead ends: 125 [2018-01-21 09:10:51,731 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 09:10:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-21 09:10:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2018-01-21 09:10:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-21 09:10:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-21 09:10:51,740 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 27 [2018-01-21 09:10:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 09:10:51,740 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-21 09:10:51,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 09:10:51,741 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-21 09:10:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 09:10:51,742 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:51,742 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] [2018-01-21 09:10:51,742 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 09:10:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash -130557319, now seen corresponding path program 1 times [2018-01-21 09:10:51,742 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:51,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:51,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,743 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:10:51,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 09:10:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 09:10:51,825 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 09:10:51,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 09:10:51,825 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 09:10:51,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 09:10:51,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 09:10:51,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 09:10:51,826 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-01-21 09:10:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 09:10:51,866 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-01-21 09:10:51,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 09:10:51,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-01-21 09:10:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 09:10:51,869 INFO L225 Difference]: With dead ends: 129 [2018-01-21 09:10:51,869 INFO L226 Difference]: Without dead ends: 90 [2018-01-21 09:10:51,869 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 09:10:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-21 09:10:51,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-01-21 09:10:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-21 09:10:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-21 09:10:51,878 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 48 [2018-01-21 09:10:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 09:10:51,879 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-21 09:10:51,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 09:10:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-21 09:10:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 09:10:51,881 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:51,881 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] [2018-01-21 09:10:51,881 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 09:10:51,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1094978108, now seen corresponding path program 1 times [2018-01-21 09:10:51,881 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:51,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:51,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,883 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 09:10:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 09:10:51,948 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 09:10:51,958 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 09:10:51,964 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 09:10:51,965 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 09:10:51,976 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 09:10:51,976 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 09:10:51,976 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 09:10:51,976 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 09:10:51,976 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 09:10:51,976 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 09:10:51,976 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 09:10:51,977 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 09:10:51,977 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 09:10:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-21 09:10:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 09:10:51,979 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:51,979 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 09:10:51,979 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 09:10:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1898919954, now seen corresponding path program 1 times [2018-01-21 09:10:51,979 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:51,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:51,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:51,980 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:10:51,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 09:10:52,001 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 09:10:52,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 09:10:52,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 09:10:52,002 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 09:10:52,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 09:10:52,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 09:10:52,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 09:10:52,003 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 2 states. [2018-01-21 09:10:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 09:10:52,009 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2018-01-21 09:10:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 09:10:52,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 09:10:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 09:10:52,010 INFO L225 Difference]: With dead ends: 124 [2018-01-21 09:10:52,010 INFO L226 Difference]: Without dead ends: 79 [2018-01-21 09:10:52,011 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 09:10:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-21 09:10:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-21 09:10:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 09:10:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-01-21 09:10:52,017 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 21 [2018-01-21 09:10:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 09:10:52,017 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-01-21 09:10:52,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 09:10:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-01-21 09:10:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 09:10:52,019 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:52,019 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 09:10:52,019 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 09:10:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1934937526, now seen corresponding path program 1 times [2018-01-21 09:10:52,019 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:52,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:52,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:52,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:52,021 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:10:52,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 09:10:52,081 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 09:10:52,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 09:10:52,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 09:10:52,081 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 09:10:52,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 09:10:52,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 09:10:52,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 09:10:52,082 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 5 states. [2018-01-21 09:10:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 09:10:52,246 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2018-01-21 09:10:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 09:10:52,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 09:10:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 09:10:52,247 INFO L225 Difference]: With dead ends: 137 [2018-01-21 09:10:52,248 INFO L226 Difference]: Without dead ends: 123 [2018-01-21 09:10:52,248 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 09:10:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-21 09:10:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 83. [2018-01-21 09:10:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-21 09:10:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-21 09:10:52,258 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 25 [2018-01-21 09:10:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 09:10:52,258 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-21 09:10:52,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 09:10:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-21 09:10:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 09:10:52,259 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:52,259 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] [2018-01-21 09:10:52,259 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 09:10:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1827795070, now seen corresponding path program 1 times [2018-01-21 09:10:52,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:52,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:52,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:52,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:52,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:10:52,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 09:10:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 09:10:52,296 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 09:10:52,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 09:10:52,297 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 09:10:52,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 09:10:52,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 09:10:52,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 09:10:52,298 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 4 states. [2018-01-21 09:10:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 09:10:52,337 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-01-21 09:10:52,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 09:10:52,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-21 09:10:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 09:10:52,338 INFO L225 Difference]: With dead ends: 125 [2018-01-21 09:10:52,338 INFO L226 Difference]: Without dead ends: 88 [2018-01-21 09:10:52,339 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 09:10:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-21 09:10:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-01-21 09:10:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-21 09:10:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-21 09:10:52,346 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 46 [2018-01-21 09:10:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 09:10:52,347 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-21 09:10:52,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 09:10:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-21 09:10:52,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 09:10:52,348 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 09:10:52,348 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] [2018-01-21 09:10:52,349 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 09:10:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1002255617, now seen corresponding path program 1 times [2018-01-21 09:10:52,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 09:10:52,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:52,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:10:52,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 09:10:52,350 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 09:10:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:10:52,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 09:10:52,583 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 09:10:52,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 09:10:52,618 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 09:10:52,619 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 09:10:52,621 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [14], [17], [18], [19], [25], [29], [31], [34], [67], [71], [75], [77], [81], [82], [83], [90], [92], [100], [102], [107], [108], [109], [115], [119], [125], [126], [130], [134], [138], [140], [141], [142], [143], [151], [153], [157], [159], [160], [161], [167], [168], [169] [2018-01-21 09:10:52,684 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 09:10:52,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-21 09:11:55,651 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-21 09:11:55,652 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-21 09:11:55,674 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 09:11:55,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 09:11:55,675 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 09:11:55,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 09:11:55,681 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 09:11:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 09:11:55,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 09:11:55,748 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 09:11:55,749 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 09:11:55,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 09:11:55 BoogieIcfgContainer [2018-01-21 09:11:55,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 09:11:55,752 INFO L168 Benchmark]: Toolchain (without parser) took 65500.82 ms. Allocated memory was 306.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.5 MB in the beginning and 529.4 MB in the end (delta: -263.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-21 09:11:55,753 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 306.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 09:11:55,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.11 ms. Allocated memory is still 306.7 MB. Free memory was 265.5 MB in the beginning and 253.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-21 09:11:55,754 INFO L168 Benchmark]: Boogie Preprocessor took 44.62 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 09:11:55,754 INFO L168 Benchmark]: RCFGBuilder took 438.76 ms. Allocated memory is still 306.7 MB. Free memory was 251.5 MB in the beginning and 224.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-01-21 09:11:55,755 INFO L168 Benchmark]: TraceAbstraction took 64793.76 ms. Allocated memory was 306.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.6 MB in the beginning and 529.4 MB in the end (delta: -304.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-21 09:11:55,756 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.11 ms. Allocated memory is still 306.7 MB. Free memory is still 271.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.11 ms. Allocated memory is still 306.7 MB. Free memory was 265.5 MB in the beginning and 253.5 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.62 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 438.76 ms. Allocated memory is still 306.7 MB. Free memory was 251.5 MB in the beginning and 224.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64793.76 ms. Allocated memory was 306.7 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 224.6 MB in the beginning and 529.4 MB in the end (delta: -304.8 MB). Peak memory consumption was 1.7 GB. 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, 84 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=84occurred 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: [L985] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={18:0}] [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L986] FCALL head->next = ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L987] COND FALSE !(__VERIFIER_nondet_int()) [L987] COND TRUE __VERIFIER_nondet_int() [L987] FCALL head->data = 1 VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L987] FCALL head->opt = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}] [L988] SLL* x = head; VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L990] COND FALSE !(__VERIFIER_nondet_int()) [L993] x = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L994] COND TRUE x != ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L996] EXPR, FCALL x->data VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1] [L996] EXPR x->data == 2 && x->opt != x VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0] [L996] EXPR x->data == 2 && x->opt != x && x->opt->next == ((void*)0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L996] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0] [L996] EXPR, FCALL x->opt VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=0, head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={18:0}] [L996] EXPR (x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x VAL [(x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x=1, head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->data=1, x->data == 2 && x->opt != x=0, x->data == 2 && x->opt != x && x->opt->next == ((void*)0)=0, x->opt={18:0}] [L996] COND FALSE !(!((x->data == 2 && x->opt != x && x->opt->next == ((void*)0)) || x->opt == x)) [L996] COND FALSE !(0) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L997] EXPR, FCALL x->next VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->next={0:0}] [L997] x = x->next [L994] COND FALSE !(x != ((void*)0)) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1000] x = head VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1002] COND TRUE x != ((void*)0) [L1004] head = x VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}] [L1005] EXPR, FCALL x->next VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={18:0}, x->next={0:0}] [L1005] x = x->next [L1006] EXPR, FCALL head->data VAL [head={18:0}, head->data=1, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1006] COND FALSE !(head->data == 2) [L1008] FCALL free(head) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1002] COND FALSE !(x != ((void*)0)) VAL [head={18:0}, malloc(sizeof(SLL))={18:0}, x={0:0}] [L1011] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 84 locations, 3 error locations. UNSAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 269 SDslu, 246 SDs, 0 SdLazy, 79 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred 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, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 4555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was analyzing trace of length 49 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, 84 locations, 3 error locations. TIMEOUT Result, 63.7s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 243 SDtfs, 269 SDslu, 236 SDs, 0 SdLazy, 79 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 63.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 4099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4/4 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/sll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_09-11-55-765.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_09-11-55-765.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_09-11-55-765.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-optional_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_09-11-55-765.csv Completed graceful shutdown