java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:06:21,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:06:21,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:06:21,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:06:21,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:06:21,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:06:21,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:06:21,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:06:21,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:06:21,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:06:21,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:06:21,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:06:21,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:06:21,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:06:21,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:06:21,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:06:21,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:06:21,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:06:21,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:06:21,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:06:21,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:06:21,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:06:21,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:06:21,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:06:21,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:06:21,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:06:21,448 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:06:21,449 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:06:21,449 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:06:21,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:06:21,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:06:21,451 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-21 10:06:21,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:06:21,460 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:06:21,461 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:06:21,461 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:06:21,461 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:06:21,462 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:06:21,462 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:06:21,462 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:06:21,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:06:21,462 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:06:21,463 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:06:21,463 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:06:21,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:06:21,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:06:21,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:06:21,463 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:06:21,463 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:06:21,464 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:06:21,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:06:21,464 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:06:21,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:06:21,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:06:21,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:06:21,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:06:21,465 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:06:21,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:06:21,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:06:21,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:06:21,465 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:06:21,466 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:06:21,467 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:06:21,467 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:06:21,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:06:21,512 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:06:21,516 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:06:21,517 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:06:21,517 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:06:21,518 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-21 10:06:21,674 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:06:21,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:06:21,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:06:21,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:06:21,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:06:21,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcefd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21, skipping insertion in model container [2018-01-21 10:06:21,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,702 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:06:21,740 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:06:21,855 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:06:21,872 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:06:21,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21 WrapperNode [2018-01-21 10:06:21,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:06:21,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:06:21,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:06:21,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:06:21,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... [2018-01-21 10:06:21,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:06:21,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:06:21,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:06:21,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:06:21,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:06:21,979 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:06:21,979 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:06:21,979 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-21 10:06:21,980 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:06:21,980 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:06:21,980 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:06:21,980 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:06:21,980 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:06:21,980 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:06:21,981 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:06:21,981 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-21 10:06:21,981 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:06:21,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:06:21,981 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:06:22,239 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:06:22,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:06:22 BoogieIcfgContainer [2018-01-21 10:06:22,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:06:22,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:06:22,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:06:22,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:06:22,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:06:21" (1/3) ... [2018-01-21 10:06:22,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db45900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:06:22, skipping insertion in model container [2018-01-21 10:06:22,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:06:21" (2/3) ... [2018-01-21 10:06:22,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db45900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:06:22, skipping insertion in model container [2018-01-21 10:06:22,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:06:22" (3/3) ... [2018-01-21 10:06:22,245 INFO L105 eAbstractionObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-01-21 10:06:22,252 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:06:22,258 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 10:06:22,292 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:06:22,292 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:06:22,292 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:06:22,293 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:06:22,293 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:06:22,293 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:06:22,293 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:06:22,293 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:06:22,294 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:06:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 10:06:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:06:22,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:22,324 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:06:22,324 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:06:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 98985, now seen corresponding path program 1 times [2018-01-21 10:06:22,333 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:22,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:22,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,378 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:22,436 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:06:22,443 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:22,450 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:06:22,450 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:06:22,450 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:06:22,450 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:06:22,451 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:06:22,451 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:06:22,451 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:06:22,451 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == test_funErr0EnsuresViolation======== [2018-01-21 10:06:22,451 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:06:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 10:06:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 10:06:22,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:22,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:06:22,454 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr0EnsuresViolation]=== [2018-01-21 10:06:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900953, now seen corresponding path program 1 times [2018-01-21 10:06:22,455 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:22,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:22,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,456 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:22,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:22,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:22,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:06:22,530 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:22,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:06:22,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:06:22,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:22,551 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-21 10:06:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:22,644 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-21 10:06:22,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:06:22,645 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-21 10:06:22,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:22,650 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:06:22,650 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:06:22,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:06:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:06:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:06:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:06:22,672 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-21 10:06:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:22,672 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:06:22,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:06:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:06:22,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:06:22,675 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:06:22,675 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:06:22,675 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:06:22,675 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:06:22,675 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:06:22,675 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:06:22,675 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:06:22,675 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:06:22,675 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:06:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 10:06:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 10:06:22,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:22,678 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 10:06:22,678 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2023555476, now seen corresponding path program 1 times [2018-01-21 10:06:22,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:22,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:22,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,680 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:22,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:22,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:22,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:06:22,712 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:22,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:06:22,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:06:22,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:22,713 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-21 10:06:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:22,718 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-21 10:06:22,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:06:22,719 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 10:06:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:22,722 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:06:22,722 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 10:06:22,723 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 10:06:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-21 10:06:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-21 10:06:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-21 10:06:22,732 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 19 [2018-01-21 10:06:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:22,733 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-21 10:06:22,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:06:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-21 10:06:22,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 10:06:22,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:22,734 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 10:06:22,734 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:22,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1465779539, now seen corresponding path program 1 times [2018-01-21 10:06:22,735 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:22,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:22,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,736 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:22,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:22,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:22,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:06:22,848 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:22,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:06:22,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:06:22,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:06:22,851 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-01-21 10:06:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:22,947 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-21 10:06:22,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:06:22,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-21 10:06:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:22,948 INFO L225 Difference]: With dead ends: 61 [2018-01-21 10:06:22,948 INFO L226 Difference]: Without dead ends: 53 [2018-01-21 10:06:22,949 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 10:06:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-21 10:06:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-01-21 10:06:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 10:06:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-21 10:06:22,956 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-01-21 10:06:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:22,957 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-21 10:06:22,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:06:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-21 10:06:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:06:22,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:22,959 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-21 10:06:22,959 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:06:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash 541564961, now seen corresponding path program 1 times [2018-01-21 10:06:22,959 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:22,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:22,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:22,961 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:06:23,002 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:06:23,008 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:23,012 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:23,013 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:23,013 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:06:23,022 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:06:23,022 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:06:23,022 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:06:23,022 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:06:23,022 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:06:23,022 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:06:23,023 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:06:23,023 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:06:23,023 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:06:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 10:06:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 10:06:23,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:23,025 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:06:23,025 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:23,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1866048671, now seen corresponding path program 1 times [2018-01-21 10:06:23,025 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:23,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:23,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:23,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:23,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:23,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:23,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:23,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:06:23,044 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:23,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:06:23,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:06:23,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:23,045 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-21 10:06:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:23,049 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-01-21 10:06:23,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:06:23,049 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 10:06:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:23,050 INFO L225 Difference]: With dead ends: 67 [2018-01-21 10:06:23,050 INFO L226 Difference]: Without dead ends: 34 [2018-01-21 10:06:23,050 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:06:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-21 10:06:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-21 10:06:23,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 10:06:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-21 10:06:23,054 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 17 [2018-01-21 10:06:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:23,054 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-21 10:06:23,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:06:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-21 10:06:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:06:23,055 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:23,055 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-21 10:06:23,055 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1279736134, now seen corresponding path program 1 times [2018-01-21 10:06:23,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:23,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:23,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:23,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:23,057 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:23,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:06:23,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:23,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:06:23,132 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:23,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:06:23,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:06:23,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:06:23,133 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-01-21 10:06:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:23,210 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-01-21 10:06:23,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:06:23,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-21 10:06:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:23,212 INFO L225 Difference]: With dead ends: 57 [2018-01-21 10:06:23,212 INFO L226 Difference]: Without dead ends: 51 [2018-01-21 10:06:23,212 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 10:06:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-21 10:06:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2018-01-21 10:06:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-21 10:06:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-21 10:06:23,216 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 18 [2018-01-21 10:06:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:23,217 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-21 10:06:23,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:06:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-21 10:06:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 10:06:23,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:06:23,218 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 10:06:23,218 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:06:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash 13971348, now seen corresponding path program 1 times [2018-01-21 10:06:23,218 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:06:23,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:23,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:06:23,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:06:23,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:06:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:06:23,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:06:23,308 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 10:06:23,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:06:23,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 10:06:23,308 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:06:23,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:06:23,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:06:23,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:06:23,309 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2018-01-21 10:06:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:06:23,418 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-01-21 10:06:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:06:23,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-21 10:06:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:06:23,420 INFO L225 Difference]: With dead ends: 36 [2018-01-21 10:06:23,420 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:06:23,420 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 10:06:23,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:06:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:06:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:06:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:06:23,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 10:06:23,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:06:23,422 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:06:23,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:06:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:06:23,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:06:23,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:06:23 BoogieIcfgContainer [2018-01-21 10:06:23,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:06:23,426 INFO L168 Benchmark]: Toolchain (without parser) took 1751.48 ms. Allocated memory was 303.0 MB in the beginning and 460.8 MB in the end (delta: 157.8 MB). Free memory was 261.2 MB in the beginning and 366.6 MB in the end (delta: -105.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:23,428 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 303.0 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:06:23,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.55 ms. Allocated memory is still 303.0 MB. Free memory was 260.2 MB in the beginning and 250.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:23,428 INFO L168 Benchmark]: Boogie Preprocessor took 39.36 ms. Allocated memory is still 303.0 MB. Free memory was 250.2 MB in the beginning and 249.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-21 10:06:23,429 INFO L168 Benchmark]: RCFGBuilder took 319.46 ms. Allocated memory is still 303.0 MB. Free memory was 248.2 MB in the beginning and 233.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:23,429 INFO L168 Benchmark]: TraceAbstraction took 1185.28 ms. Allocated memory was 303.0 MB in the beginning and 460.8 MB in the end (delta: 157.8 MB). Free memory was 232.2 MB in the beginning and 366.6 MB in the end (delta: -134.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. [2018-01-21 10:06:23,431 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.15 ms. Allocated memory is still 303.0 MB. Free memory is still 267.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.55 ms. Allocated memory is still 303.0 MB. Free memory was 260.2 MB in the beginning and 250.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.36 ms. Allocated memory is still 303.0 MB. Free memory was 250.2 MB in the beginning and 249.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 319.46 ms. Allocated memory is still 303.0 MB. Free memory was 248.2 MB in the beginning and 233.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1185.28 ms. Allocated memory was 303.0 MB in the beginning and 460.8 MB in the end (delta: 157.8 MB). Free memory was 232.2 MB in the beginning and 366.6 MB in the end (delta: -134.4 MB). Peak memory consumption was 23.4 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.1s 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.1s 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.4s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-06-23-441.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-06-23-441.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-06-23-441.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-06-23-441.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-06-23-441.csv Received shutdown request...