java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:30:57,590 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:30:57,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:30:57,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:30:57,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:30:57,608 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:30:57,609 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:30:57,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:30:57,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:30:57,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:30:57,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:30:57,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:30:57,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:30:57,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:30:57,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:30:57,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:30:57,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:30:57,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:30:57,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:30:57,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:30:57,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:30:57,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:30:57,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:30:57,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:30:57,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:30:57,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:30:57,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:30:57,633 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:30:57,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:30:57,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:30:57,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:30:57,635 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:30:57,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:30:57,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:30:57,646 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:30:57,646 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:30:57,646 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:30:57,646 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:30:57,646 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:30:57,647 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:30:57,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:30:57,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:30:57,648 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:30:57,648 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:30:57,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:30:57,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:30:57,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:30:57,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:30:57,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:30:57,649 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:30:57,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:30:57,649 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:30:57,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:30:57,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:30:57,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:30:57,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:30:57,650 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:30:57,651 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:30:57,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:30:57,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:30:57,651 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:30:57,652 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:30:57,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:30:57,652 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:30:57,652 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:30:57,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:30:57,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:30:57,653 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:30:57,653 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:30:57,654 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:30:57,654 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:30:57,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:30:57,701 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:30:57,706 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:30:57,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:30:57,708 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:30:57,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:57,871 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:30:57,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:30:57,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:57,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:30:57,886 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:30:57,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:57" (1/1) ... [2018-01-21 00:30:57,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2fa6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:57, skipping insertion in model container [2018-01-21 00:30:57,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:57" (1/1) ... [2018-01-21 00:30:57,913 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:57,953 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:58,071 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:58,087 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:58,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58 WrapperNode [2018-01-21 00:30:58,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:58,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:30:58,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:30:58,094 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:30:58,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (1/1) ... [2018-01-21 00:30:58,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (1/1) ... [2018-01-21 00:30:58,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (1/1) ... [2018-01-21 00:30:58,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (1/1) ... [2018-01-21 00:30:58,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (1/1) ... [2018-01-21 00:30:58,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (1/1) ... [2018-01-21 00:30:58,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (1/1) ... [2018-01-21 00:30:58,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:30:58,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:30:58,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:30:58,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:30:58,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (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 00:30:58,169 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:30:58,169 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:30:58,169 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-01-21 00:30:58,169 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:30:58,169 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:30:58,169 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:30:58,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:30:58,169 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:30:58,170 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:30:58,170 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:30:58,170 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-01-21 00:30:58,170 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:30:58,170 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:30:58,170 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:30:58,333 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:30:58,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:58 BoogieIcfgContainer [2018-01-21 00:30:58,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:30:58,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:30:58,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:30:58,335 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:30:58,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:30:57" (1/3) ... [2018-01-21 00:30:58,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83f16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:58, skipping insertion in model container [2018-01-21 00:30:58,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:58" (2/3) ... [2018-01-21 00:30:58,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c83f16e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:58, skipping insertion in model container [2018-01-21 00:30:58,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:58" (3/3) ... [2018-01-21 00:30:58,339 INFO L105 eAbstractionObserver]: Analyzing ICFG stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:58,345 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:30:58,351 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:30:58,397 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:58,397 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:58,398 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:58,398 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:58,398 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:58,398 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:58,398 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:58,398 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:30:58,399 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 00:30:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:30:58,420 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:58,421 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:30:58,421 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:30:58,427 INFO L82 PathProgramCache]: Analyzing trace with hash 70155, now seen corresponding path program 1 times [2018-01-21 00:30:58,430 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:58,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:58,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,491 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:58,548 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:58,553 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:58,558 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:58,558 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:58,559 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:58,559 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:58,559 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:58,559 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:58,559 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:58,559 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == sumOfThirdBytesErr0EnsuresViolation======== [2018-01-21 00:30:58,559 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:58,560 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 00:30:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:30:58,561 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:58,561 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:58,561 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr0EnsuresViolation]=== [2018-01-21 00:30:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1395541294, now seen corresponding path program 1 times [2018-01-21 00:30:58,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:58,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:58,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,563 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:58,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:58,616 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 00:30:58,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:58,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:58,617 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:58,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:58,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:58,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:58,631 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-01-21 00:30:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:58,653 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-21 00:30:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:58,721 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-21 00:30:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:58,729 INFO L225 Difference]: With dead ends: 42 [2018-01-21 00:30:58,730 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:58,733 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 00:30:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:58,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:58,754 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 00:30:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:58,755 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:58,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:58,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:58,757 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:58,757 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:58,757 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:58,757 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:58,757 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:58,758 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:58,758 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:58,758 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:30:58,758 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 00:30:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 00:30:58,760 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:58,761 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 00:30:58,761 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1213268337, now seen corresponding path program 1 times [2018-01-21 00:30:58,761 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:58,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:58,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:58,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:58,796 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 00:30:58,797 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:58,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:58,797 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:58,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:58,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:58,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:58,798 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-01-21 00:30:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:58,802 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-21 00:30:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:58,802 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 00:30:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:58,806 INFO L225 Difference]: With dead ends: 42 [2018-01-21 00:30:58,806 INFO L226 Difference]: Without dead ends: 26 [2018-01-21 00:30:58,806 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 00:30:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-21 00:30:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-01-21 00:30:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-21 00:30:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-21 00:30:58,817 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2018-01-21 00:30:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:58,818 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-21 00:30:58,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-21 00:30:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 00:30:58,819 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:58,819 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 00:30:58,819 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1087049420, now seen corresponding path program 1 times [2018-01-21 00:30:58,820 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:58,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:58,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:58,821 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:58,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:58,951 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 00:30:58,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:58,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:30:58,951 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:58,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:30:58,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:30:58,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:30:58,953 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-01-21 00:30:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:59,033 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-21 00:30:59,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:59,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 00:30:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:59,035 INFO L225 Difference]: With dead ends: 41 [2018-01-21 00:30:59,035 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 00:30:59,036 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 00:30:59,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-01-21 00:30:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-21 00:30:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-01-21 00:30:59,042 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-01-21 00:30:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:59,042 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-01-21 00:30:59,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:30:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-01-21 00:30:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:30:59,043 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:59,044 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-21 00:30:59,044 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:59,044 INFO L82 PathProgramCache]: Analyzing trace with hash -375422602, now seen corresponding path program 1 times [2018-01-21 00:30:59,044 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:59,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,045 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:59,045 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,045 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:59,093 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:59,099 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:59,110 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:59,112 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:59,112 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:59,122 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:59,122 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:59,122 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:59,122 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:59,122 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:59,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:59,123 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:59,123 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:30:59,123 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-21 00:30:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:30:59,124 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:59,124 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:59,124 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2023316251, now seen corresponding path program 1 times [2018-01-21 00:30:59,125 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:59,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,126 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:59,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,126 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:59,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:59,141 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 00:30:59,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:59,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:59,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:59,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:59,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:59,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:59,143 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-01-21 00:30:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:59,145 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-01-21 00:30:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:59,145 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 00:30:59,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:59,146 INFO L225 Difference]: With dead ends: 42 [2018-01-21 00:30:59,146 INFO L226 Difference]: Without dead ends: 24 [2018-01-21 00:30:59,146 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 00:30:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-21 00:30:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-21 00:30:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-21 00:30:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-21 00:30:59,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2018-01-21 00:30:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:59,149 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-21 00:30:59,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-21 00:30:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:30:59,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:59,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:59,150 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:59,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1762023064, now seen corresponding path program 1 times [2018-01-21 00:30:59,150 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:59,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:59,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,151 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:59,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:59,204 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 00:30:59,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:59,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:30:59,205 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:59,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:30:59,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:30:59,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:30:59,206 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-01-21 00:30:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:59,282 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-01-21 00:30:59,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:59,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-21 00:30:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:59,283 INFO L225 Difference]: With dead ends: 37 [2018-01-21 00:30:59,283 INFO L226 Difference]: Without dead ends: 29 [2018-01-21 00:30:59,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:30:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-21 00:30:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-01-21 00:30:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-01-21 00:30:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-01-21 00:30:59,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-01-21 00:30:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:59,289 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-01-21 00:30:59,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:30:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-01-21 00:30:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:30:59,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:59,290 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:30:59,290 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash 669999658, now seen corresponding path program 1 times [2018-01-21 00:30:59,291 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:59,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:59,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:59,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:59,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:30:59,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:59,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:30:59,379 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:59,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 00:30:59,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 00:30:59,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 00:30:59,380 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 4 states. [2018-01-21 00:30:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:59,435 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-01-21 00:30:59,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:30:59,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-21 00:30:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:59,436 INFO L225 Difference]: With dead ends: 26 [2018-01-21 00:30:59,437 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:59,437 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 00:30:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:59,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 00:30:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:59,438 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:59,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 00:30:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:59,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:59,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:30:59 BoogieIcfgContainer [2018-01-21 00:30:59,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:30:59,443 INFO L168 Benchmark]: Toolchain (without parser) took 1570.89 ms. Allocated memory was 307.8 MB in the beginning and 468.2 MB in the end (delta: 160.4 MB). Free memory was 266.1 MB in the beginning and 383.4 MB in the end (delta: -117.4 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:59,444 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 307.8 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:30:59,445 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.07 ms. Allocated memory is still 307.8 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:59,445 INFO L168 Benchmark]: Boogie Preprocessor took 29.25 ms. Allocated memory is still 307.8 MB. Free memory was 255.1 MB in the beginning and 254.1 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-21 00:30:59,445 INFO L168 Benchmark]: RCFGBuilder took 209.48 ms. Allocated memory is still 307.8 MB. Free memory was 254.1 MB in the beginning and 239.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:59,446 INFO L168 Benchmark]: TraceAbstraction took 1108.30 ms. Allocated memory was 307.8 MB in the beginning and 468.2 MB in the end (delta: 160.4 MB). Free memory was 239.5 MB in the beginning and 383.4 MB in the end (delta: -144.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:59,447 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.21 ms. Allocated memory is still 307.8 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.07 ms. Allocated memory is still 307.8 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.25 ms. Allocated memory is still 307.8 MB. Free memory was 255.1 MB in the beginning and 254.1 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 209.48 ms. Allocated memory is still 307.8 MB. Free memory was 254.1 MB in the beginning and 239.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1108.30 ms. Allocated memory was 307.8 MB in the beginning and 468.2 MB in the end (delta: 160.4 MB). Free memory was 239.5 MB in the beginning and 383.4 MB in the end (delta: -144.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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 4 procedures, 30 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: sumOfThirdBytesErr0EnsuresViolation CFG has 4 procedures, 30 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L553] int array_size = __VERIFIER_nondet_int(); [L554] COND FALSE !(array_size < 1 || array_size >= 2147483647 / sizeof(int)) VAL [array_size=1] [L557] EXPR, FCALL __builtin_alloca (array_size * sizeof(int)) VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1] [L557] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1, numbers={6:0}] [L558] CALL, EXPR sumOfThirdBytes(numbers, array_size) VAL [\old(array_size)=1, numbers={6:0}] [L542] int i, sum; [L543] char* p; [L544] sum = 0 [L545] i = 0 VAL [\old(array_size)=1, array_size=1, i=0, numbers={6:0}, numbers={6:0}, sum=0] [L545] COND TRUE i < array_size [L546] p = &(numbers[i]) [L547] p = p + 2 VAL [\old(array_size)=1, array_size=1, i=0, numbers={6:0}, numbers={6:0}, p={6:2}, sum=0] [L548] EXPR, FCALL \read(*p) VAL [\old(array_size)=1, \read(*p)=0, array_size=1, i=0, numbers={6:0}, numbers={6:0}, p={6:2}, sum=0] [L548] sum = sum + *p [L545] i++ VAL [\old(array_size)=1, array_size=1, i=1, numbers={6:0}, numbers={6:0}, p={6:2}, sum=0] [L545] COND FALSE !(i < array_size) VAL [\old(array_size)=1, array_size=1, i=1, numbers={6:0}, numbers={6:0}, p={6:2}, sum=0] [L550] RET return sum; VAL [\old(array_size)=1, \result=0, array_size=1, i=1, numbers={6:0}, numbers={6:0}, p={6:2}, sum=0] [L558] EXPR sumOfThirdBytes(numbers, array_size) VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1, numbers={6:0}, sumOfThirdBytes(numbers, array_size)=0] [L558] return sumOfThirdBytes(numbers, array_size); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 30 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 53 SDtfs, 10 SDslu, 57 SDs, 0 SdLazy, 18 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 1345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 30 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 20 SDslu, 55 SDs, 0 SdLazy, 44 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 2965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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/stroeder1-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-30-59-458.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-30-59-458.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-30-59-458.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-30-59-458.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-30-59-458.csv Received shutdown request...