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.epf -i ../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:24:00,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:24:00,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:24:00,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:24:00,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:24:00,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:24:00,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:24:00,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:24:00,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:24:00,546 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:24:00,546 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:24:00,546 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:24:00,547 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:24:00,549 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:24:00,550 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:24:00,552 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:24:00,555 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:24:00,557 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:24:00,558 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:24:00,560 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:24:00,562 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:24:00,562 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:24:00,562 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:24:00,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:24:00,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:24:00,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:24:00,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:24:00,566 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:24:00,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:24:00,567 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:24:00,568 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:24:00,568 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.epf [2018-01-20 23:24:00,578 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:24:00,578 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:24:00,579 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:24:00,579 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:24:00,579 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:24:00,580 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:24:00,580 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:24:00,580 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:24:00,581 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:24:00,581 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:24:00,581 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:24:00,581 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:24:00,581 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:24:00,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:24:00,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:24:00,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:24:00,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:24:00,582 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:24:00,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:24:00,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:24:00,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:24:00,583 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:24:00,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:24:00,584 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:24:00,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:24:00,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:24:00,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:24:00,585 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:24:00,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:24:00,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:24:00,585 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:24:00,585 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:24:00,586 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:24:00,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:24:00,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:24:00,586 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:24:00,587 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:24:00,587 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:24:00,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:24:00,635 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:24:00,639 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:24:00,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:24:00,641 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:24:00,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-01-20 23:24:00,812 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:24:00,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:24:00,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:00,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:24:00,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:24:00,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:00" (1/1) ... [2018-01-20 23:24:00,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793dbc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:00, skipping insertion in model container [2018-01-20 23:24:00,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:00" (1/1) ... [2018-01-20 23:24:00,848 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:00,891 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:01,016 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:01,031 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:01,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01 WrapperNode [2018-01-20 23:24:01,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:01,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:24:01,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:24:01,038 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:24:01,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... [2018-01-20 23:24:01,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... [2018-01-20 23:24:01,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... [2018-01-20 23:24:01,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... [2018-01-20 23:24:01,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... [2018-01-20 23:24:01,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... [2018-01-20 23:24:01,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... [2018-01-20 23:24:01,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:24:01,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:24:01,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:24:01,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:24:01,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:24:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:24:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:24:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-20 23:24:01,121 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:24:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:24:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:24:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:24:01,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:24:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:24:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:24:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-20 23:24:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:24:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:24:01,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:24:01,319 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:24:01,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:01 BoogieIcfgContainer [2018-01-20 23:24:01,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:24:01,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:24:01,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:24:01,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:24:01,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:24:00" (1/3) ... [2018-01-20 23:24:01,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7bd18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:01, skipping insertion in model container [2018-01-20 23:24:01,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:01" (2/3) ... [2018-01-20 23:24:01,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d7bd18d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:01, skipping insertion in model container [2018-01-20 23:24:01,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:01" (3/3) ... [2018-01-20 23:24:01,326 INFO L105 eAbstractionObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-01-20 23:24:01,332 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:24:01,338 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 23:24:01,378 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:01,378 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:01,379 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:01,379 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:01,379 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:01,379 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:01,379 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:01,379 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:24:01,380 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:24:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:24:01,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:01,407 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:24:01,407 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:24:01,412 INFO L82 PathProgramCache]: Analyzing trace with hash 98985, now seen corresponding path program 1 times [2018-01-20 23:24:01,415 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:01,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:01,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,458 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:01,510 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:24:01,516 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:01,522 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:01,522 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:01,522 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:01,522 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:01,522 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:01,522 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:01,522 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:01,522 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == test_funErr0EnsuresViolation======== [2018-01-20 23:24:01,523 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:24:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 23:24:01,525 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:01,525 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:01,525 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr0EnsuresViolation]=== [2018-01-20 23:24:01,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900953, now seen corresponding path program 1 times [2018-01-20 23:24:01,525 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:01,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:01,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:01,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:24:01,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:01,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:01,598 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:01,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:01,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:01,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:01,613 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-20 23:24:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:01,641 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-20 23:24:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:01,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-20 23:24:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:01,651 INFO L225 Difference]: With dead ends: 67 [2018-01-20 23:24:01,651 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:24:01,654 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:01,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:24:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:24:01,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:24:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:24:01,739 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-20 23:24:01,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:01,739 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:24:01,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:24:01,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:24:01,742 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:01,742 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:01,742 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:01,742 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:01,742 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:01,742 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:01,742 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:01,742 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:24:01,743 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:24:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 23:24:01,745 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:01,745 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-20 23:24:01,745 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:01,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2023555476, now seen corresponding path program 1 times [2018-01-20 23:24:01,745 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:01,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:01,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:01,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:24:01,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:01,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:01,776 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:01,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:01,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:01,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:01,777 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-20 23:24:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:01,782 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-20 23:24:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:01,782 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-20 23:24:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:01,784 INFO L225 Difference]: With dead ends: 67 [2018-01-20 23:24:01,785 INFO L226 Difference]: Without dead ends: 36 [2018-01-20 23:24:01,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-20 23:24:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-20 23:24:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-20 23:24:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-20 23:24:01,794 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 19 [2018-01-20 23:24:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:01,794 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-20 23:24:01,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-20 23:24:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-20 23:24:01,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:01,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:01,795 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:01,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1465779539, now seen corresponding path program 1 times [2018-01-20 23:24:01,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:01,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:01,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:01,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:01,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:24:01,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:01,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:24:01,900 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:01,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:24:01,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:24:01,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:24:01,902 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-01-20 23:24:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:02,034 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-20 23:24:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:02,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-20 23:24:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:02,037 INFO L225 Difference]: With dead ends: 61 [2018-01-20 23:24:02,037 INFO L226 Difference]: Without dead ends: 53 [2018-01-20 23:24:02,038 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-20 23:24:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-20 23:24:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-01-20 23:24:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-20 23:24:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-20 23:24:02,045 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-01-20 23:24:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:02,045 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-20 23:24:02,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:24:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-20 23:24:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 23:24:02,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:02,047 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, 1, 1] [2018-01-20 23:24:02,047 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:02,047 INFO L82 PathProgramCache]: Analyzing trace with hash 541564961, now seen corresponding path program 1 times [2018-01-20 23:24:02,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:02,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:02,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:02,096 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:24:02,103 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:02,106 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:02,107 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:02,108 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:02,119 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:02,119 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:02,119 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:02,120 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:02,120 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:02,120 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:02,120 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:02,120 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:24:02,120 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:24:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 23:24:02,123 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:02,123 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:02,123 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1866048671, now seen corresponding path program 1 times [2018-01-20 23:24:02,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:02,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:02,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:02,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:24:02,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:02,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:24:02,148 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:02,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:24:02,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:24:02,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:02,149 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-20 23:24:02,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:02,154 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-20 23:24:02,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:24:02,154 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-20 23:24:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:02,155 INFO L225 Difference]: With dead ends: 67 [2018-01-20 23:24:02,155 INFO L226 Difference]: Without dead ends: 34 [2018-01-20 23:24:02,156 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:24:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-20 23:24:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-20 23:24:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 23:24:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-20 23:24:02,160 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 17 [2018-01-20 23:24:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:02,160 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-20 23:24:02,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:24:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-20 23:24:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 23:24:02,161 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:02,161 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:02,161 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:02,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1279736134, now seen corresponding path program 1 times [2018-01-20 23:24:02,161 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:02,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:02,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,162 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:02,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:02,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:24:02,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:02,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:24:02,222 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:02,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:24:02,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:24:02,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:24:02,223 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-01-20 23:24:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:02,310 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-01-20 23:24:02,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:02,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-20 23:24:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:02,312 INFO L225 Difference]: With dead ends: 57 [2018-01-20 23:24:02,312 INFO L226 Difference]: Without dead ends: 51 [2018-01-20 23:24:02,313 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-20 23:24:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-20 23:24:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2018-01-20 23:24:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-20 23:24:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-20 23:24:02,318 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 18 [2018-01-20 23:24:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:02,319 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-20 23:24:02,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:24:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-20 23:24:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:24:02,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:02,320 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-20 23:24:02,320 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 13971348, now seen corresponding path program 1 times [2018-01-20 23:24:02,320 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:02,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:02,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:02,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:02,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:02,405 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-20 23:24:02,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:02,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:24:02,405 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:02,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:02,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:02,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:02,406 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2018-01-20 23:24:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:02,486 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-01-20 23:24:02,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:02,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-20 23:24:02,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:02,487 INFO L225 Difference]: With dead ends: 36 [2018-01-20 23:24:02,487 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:24:02,488 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-20 23:24:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:24:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:24:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:24:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:24:02,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-20 23:24:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:02,489 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:24:02,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:24:02,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:24:02,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:24:02 BoogieIcfgContainer [2018-01-20 23:24:02,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:24:02,493 INFO L168 Benchmark]: Toolchain (without parser) took 1680.09 ms. Allocated memory was 306.7 MB in the beginning and 467.7 MB in the end (delta: 161.0 MB). Free memory was 265.0 MB in the beginning and 374.6 MB in the end (delta: -109.5 MB). Peak memory consumption was 51.4 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:02,494 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:24:02,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.37 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 253.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:02,495 INFO L168 Benchmark]: Boogie Preprocessor took 35.31 ms. Allocated memory is still 306.7 MB. Free memory was 253.9 MB in the beginning and 252.9 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-20 23:24:02,495 INFO L168 Benchmark]: RCFGBuilder took 245.65 ms. Allocated memory is still 306.7 MB. Free memory was 252.9 MB in the beginning and 237.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:02,496 INFO L168 Benchmark]: TraceAbstraction took 1172.37 ms. Allocated memory was 306.7 MB in the beginning and 467.7 MB in the end (delta: 161.0 MB). Free memory was 236.2 MB in the beginning and 374.6 MB in the end (delta: -138.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:02,498 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.27 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.37 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 253.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.31 ms. Allocated memory is still 306.7 MB. Free memory was 253.9 MB in the beginning and 252.9 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 245.65 ms. Allocated memory is still 306.7 MB. Free memory was 252.9 MB in the beginning and 237.2 MB in the end (delta: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1172.37 ms. Allocated memory was 306.7 MB in the beginning and 467.7 MB in the end (delta: 161.0 MB). Free memory was 236.2 MB in the beginning and 374.6 MB in the end (delta: -138.3 MB). Peak memory consumption was 22.6 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, 40 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=40occurred 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: test_funErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 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=40occurred 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, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 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: [L557] int array_size = __VERIFIER_nondet_int(); [L558] COND TRUE array_size < 1 || array_size >= 2147483647 / sizeof(int) [L559] array_size = 1 VAL [array_size=1] [L561] EXPR, FCALL __builtin_alloca (array_size * sizeof(int)) VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1] [L561] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1, numbers={6:0}] [L562] CALL test_fun(numbers, array_size) VAL [\old(N)=1, a={6:0}] [L542] int i; [L543] int pos = 0; [L544] int neg = 0; [L545] i = 0 VAL [\old(N)=1, a={6:0}, a={6:0}, i=0, N=1, neg=0, pos=0] [L545] COND TRUE i < N VAL [\old(N)=1, a={6:0}, a={6:0}, i=0, N=1, neg=0, pos=0] [L546] EXPR, FCALL a[i] VAL [\old(N)=1, a={6:0}, a={6:0}, a[i]=0, i=0, N=1, neg=0, pos=0] [L546] COND FALSE !(a[i] < 0) [L550] EXPR, FCALL a[i] VAL [\old(N)=1, a={6:0}, a={6:0}, a[i]=0, i=0, N=1, neg=0, pos=0] [L550] COND FALSE !(a[i] > 0) [L545] i++ VAL [\old(N)=1, a={6:0}, a={6:0}, i=1, N=1, neg=0, pos=0] [L545] COND FALSE, RET !(i < N) VAL [\old(N)=1, a={6:0}, a={6:0}, i=1, N=1, neg=0, pos=0] [L562] test_fun(numbers, array_size) - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 71 SDtfs, 22 SDslu, 76 SDs, 0 SdLazy, 42 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=40occurred 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, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 1103 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: 556]: 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, 40 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 100 SDtfs, 45 SDslu, 73 SDs, 0 SdLazy, 81 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=40occurred 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, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 59 ConstructedInterpolants, 0 QuantifiedInterpolants, 2687 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/array02-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-24-02-508.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-24-02-508.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-24-02-508.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-24-02-508.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-24-02-508.csv Received shutdown request...