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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 02:48:17,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 02:48:17,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 02:48:17,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 02:48:17,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 02:48:17,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 02:48:17,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 02:48:17,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 02:48:17,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 02:48:17,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 02:48:17,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 02:48:17,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 02:48:17,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 02:48:17,183 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 02:48:17,184 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 02:48:17,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 02:48:17,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 02:48:17,191 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 02:48:17,192 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 02:48:17,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 02:48:17,196 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 02:48:17,196 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 02:48:17,197 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 02:48:17,198 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 02:48:17,199 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 02:48:17,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 02:48:17,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 02:48:17,201 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 02:48:17,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 02:48:17,201 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 02:48:17,202 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 02:48:17,202 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_mostprecise.epf [2018-01-21 02:48:17,211 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 02:48:17,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 02:48:17,212 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 02:48:17,212 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 02:48:17,213 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 02:48:17,213 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 02:48:17,213 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 02:48:17,213 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 02:48:17,213 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 02:48:17,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 02:48:17,214 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 02:48:17,214 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 02:48:17,214 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 02:48:17,214 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 02:48:17,214 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 02:48:17,214 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 02:48:17,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 02:48:17,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 02:48:17,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 02:48:17,215 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 02:48:17,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 02:48:17,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 02:48:17,215 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 02:48:17,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 02:48:17,216 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 02:48:17,216 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 02:48:17,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 02:48:17,216 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 02:48:17,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 02:48:17,217 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 02:48:17,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 02:48:17,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 02:48:17,217 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 02:48:17,217 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 02:48:17,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 02:48:17,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 02:48:17,218 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 02:48:17,218 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 02:48:17,218 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 02:48:17,219 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 02:48:17,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 02:48:17,266 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 02:48:17,270 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 02:48:17,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 02:48:17,272 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 02:48:17,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-01-21 02:48:17,724 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 02:48:17,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 02:48:17,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 02:48:17,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 02:48:17,735 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 02:48:17,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2fa6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17, skipping insertion in model container [2018-01-21 02:48:17,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,752 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:48:17,791 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 02:48:17,906 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:48:17,923 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 02:48:17,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17 WrapperNode [2018-01-21 02:48:17,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 02:48:17,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 02:48:17,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 02:48:17,931 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 02:48:17,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (1/1) ... [2018-01-21 02:48:17,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 02:48:17,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 02:48:17,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 02:48:17,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 02:48:17,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (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 02:48:18,007 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 02:48:18,007 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 02:48:18,007 INFO L136 BoogieDeclarations]: Found implementation of procedure bubbleSort [2018-01-21 02:48:18,007 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 02:48:18,007 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 02:48:18,007 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 02:48:18,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 02:48:18,007 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 02:48:18,007 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 02:48:18,008 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 02:48:18,008 INFO L128 BoogieDeclarations]: Found specification of procedure bubbleSort [2018-01-21 02:48:18,008 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 02:48:18,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 02:48:18,008 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 02:48:18,175 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 02:48:18,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:48:18 BoogieIcfgContainer [2018-01-21 02:48:18,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 02:48:18,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 02:48:18,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 02:48:18,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 02:48:18,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 02:48:17" (1/3) ... [2018-01-21 02:48:18,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5148f91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:48:18, skipping insertion in model container [2018-01-21 02:48:18,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 02:48:17" (2/3) ... [2018-01-21 02:48:18,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5148f91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 02:48:18, skipping insertion in model container [2018-01-21 02:48:18,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 02:48:18" (3/3) ... [2018-01-21 02:48:18,182 INFO L105 eAbstractionObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-01-21 02:48:18,189 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 02:48:18,196 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 02:48:18,239 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:48:18,239 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:48:18,239 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:48:18,239 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:48:18,240 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:48:18,240 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:48:18,240 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:48:18,240 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == bubbleSortErr0EnsuresViolation======== [2018-01-21 02:48:18,241 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:48:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-01-21 02:48:18,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 02:48:18,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:18,267 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:48:18,267 INFO L371 AbstractCegarLoop]: === Iteration 1 === [bubbleSortErr0EnsuresViolation]=== [2018-01-21 02:48:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1101389596, now seen corresponding path program 1 times [2018-01-21 02:48:18,273 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:18,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:18,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,318 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:18,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:18,454 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 02:48:18,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:18,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:48:18,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:18,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:48:18,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:48:18,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:48:18,471 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-01-21 02:48:18,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:18,492 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-01-21 02:48:18,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:48:18,493 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-21 02:48:18,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:18,499 INFO L225 Difference]: With dead ends: 65 [2018-01-21 02:48:18,500 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:48:18,504 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 02:48:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:48:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:48:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:48:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:48:18,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-01-21 02:48:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:18,610 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:48:18,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:48:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:48:18,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:48:18,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 02:48:18,637 INFO L404 ceAbstractionStarter]: At program point L544'''(lines 544 550) the Hoare annotation is: true [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 551) no Hoare annotation was computed. [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 551) no Hoare annotation was computed. [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-21 02:48:18,638 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-21 02:48:18,639 INFO L401 ceAbstractionStarter]: For program point bubbleSortEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-21 02:48:18,639 INFO L404 ceAbstractionStarter]: At program point L543'''(lines 543 551) the Hoare annotation is: true [2018-01-21 02:48:18,639 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr0EnsuresViolation(lines 540 552) no Hoare annotation was computed. [2018-01-21 02:48:18,639 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-21 02:48:18,639 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-21 02:48:18,639 INFO L401 ceAbstractionStarter]: For program point L544''(lines 544 550) no Hoare annotation was computed. [2018-01-21 02:48:18,640 INFO L401 ceAbstractionStarter]: For program point L543''(lines 543 551) no Hoare annotation was computed. [2018-01-21 02:48:18,640 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-21 02:48:18,640 INFO L404 ceAbstractionStarter]: At program point bubbleSortENTRY(lines 540 552) the Hoare annotation is: true [2018-01-21 02:48:18,640 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-21 02:48:18,640 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-21 02:48:18,641 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-21 02:48:18,641 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: true [2018-01-21 02:48:18,641 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-21 02:48:18,641 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-21 02:48:18,641 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-21 02:48:18,641 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-21 02:48:18,642 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-21 02:48:18,642 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-21 02:48:18,642 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-21 02:48:18,642 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-21 02:48:18,642 INFO L404 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: true [2018-01-21 02:48:18,642 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-21 02:48:18,643 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-21 02:48:18,643 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: true [2018-01-21 02:48:18,643 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-21 02:48:18,643 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-21 02:48:18,643 INFO L401 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-21 02:48:18,643 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-21 02:48:18,643 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-21 02:48:18,647 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:48:18,647 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:48:18,647 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:48:18,648 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:48:18,648 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:48:18,648 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:48:18,648 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:48:18,648 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 02:48:18,648 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:48:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-01-21 02:48:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 02:48:18,651 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:18,651 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 02:48:18,651 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 02:48:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash 93634, now seen corresponding path program 1 times [2018-01-21 02:48:18,651 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:18,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:18,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,653 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:18,686 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 02:48:18,691 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:18,695 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:48:18,695 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:48:18,695 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:48:18,695 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:48:18,695 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:48:18,696 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:48:18,696 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:48:18,696 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 02:48:18,696 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:48:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-01-21 02:48:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 02:48:18,698 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:18,698 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 02:48:18,698 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:48:18,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1803313266, now seen corresponding path program 1 times [2018-01-21 02:48:18,698 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:18,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:18,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:18,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:18,730 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 02:48:18,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:18,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:48:18,731 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:18,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:48:18,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:48:18,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:48:18,732 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-01-21 02:48:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:18,737 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-01-21 02:48:18,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:48:18,738 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 02:48:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:18,742 INFO L225 Difference]: With dead ends: 65 [2018-01-21 02:48:18,742 INFO L226 Difference]: Without dead ends: 35 [2018-01-21 02:48:18,743 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 02:48:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-21 02:48:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-21 02:48:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 02:48:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-21 02:48:18,754 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2018-01-21 02:48:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:18,754 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-21 02:48:18,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:48:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-21 02:48:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 02:48:18,755 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:18,755 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 02:48:18,755 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:48:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash 933707504, now seen corresponding path program 1 times [2018-01-21 02:48:18,755 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:18,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:18,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,756 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:18,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:18,829 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 02:48:18,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:18,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 02:48:18,830 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:18,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 02:48:18,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 02:48:18,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:48:18,832 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2018-01-21 02:48:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:18,907 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-01-21 02:48:18,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:48:18,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-21 02:48:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:18,910 INFO L225 Difference]: With dead ends: 59 [2018-01-21 02:48:18,910 INFO L226 Difference]: Without dead ends: 50 [2018-01-21 02:48:18,911 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 02:48:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-21 02:48:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2018-01-21 02:48:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 02:48:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-21 02:48:18,919 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 21 [2018-01-21 02:48:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:18,919 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-21 02:48:18,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 02:48:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-21 02:48:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 02:48:18,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:18,921 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] [2018-01-21 02:48:18,921 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 02:48:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash -541122165, now seen corresponding path program 1 times [2018-01-21 02:48:18,922 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:18,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,923 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:18,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,923 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 02:48:18,965 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 02:48:18,971 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:18,974 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:18,975 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:18,975 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 02:48:18,986 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 02:48:18,986 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 02:48:18,986 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 02:48:18,986 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 02:48:18,986 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 02:48:18,986 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 02:48:18,987 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 02:48:18,987 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 02:48:18,987 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 02:48:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-01-21 02:48:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 02:48:18,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:18,990 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 02:48:18,990 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 02:48:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1280087366, now seen corresponding path program 1 times [2018-01-21 02:48:18,991 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:18,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:18,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:18,992 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:19,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:19,040 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 02:48:19,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:19,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 02:48:19,041 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:19,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 02:48:19,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 02:48:19,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 02:48:19,042 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 2 states. [2018-01-21 02:48:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:19,057 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-01-21 02:48:19,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 02:48:19,057 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 02:48:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:19,058 INFO L225 Difference]: With dead ends: 65 [2018-01-21 02:48:19,058 INFO L226 Difference]: Without dead ends: 33 [2018-01-21 02:48:19,059 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 02:48:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-21 02:48:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-21 02:48:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-21 02:48:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-01-21 02:48:19,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 18 [2018-01-21 02:48:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:19,071 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-01-21 02:48:19,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 02:48:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-01-21 02:48:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 02:48:19,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:19,072 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 02:48:19,072 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 02:48:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash -772211900, now seen corresponding path program 1 times [2018-01-21 02:48:19,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:19,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:19,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:19,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:19,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:19,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:19,128 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 02:48:19,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:19,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 02:48:19,129 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:19,129 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 02:48:19,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 02:48:19,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 02:48:19,130 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-01-21 02:48:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:19,251 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-01-21 02:48:19,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:48:19,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 02:48:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:19,255 INFO L225 Difference]: With dead ends: 55 [2018-01-21 02:48:19,255 INFO L226 Difference]: Without dead ends: 48 [2018-01-21 02:48:19,255 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 02:48:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-21 02:48:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-01-21 02:48:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 02:48:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-21 02:48:19,264 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2018-01-21 02:48:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:19,264 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-21 02:48:19,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 02:48:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-21 02:48:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 02:48:19,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 02:48:19,265 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] [2018-01-21 02:48:19,265 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 02:48:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1202796385, now seen corresponding path program 1 times [2018-01-21 02:48:19,266 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 02:48:19,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:19,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 02:48:19,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 02:48:19,267 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 02:48:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 02:48:19,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 02:48:19,384 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 02:48:19,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 02:48:19,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 02:48:19,384 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 02:48:19,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 02:48:19,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 02:48:19,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 02:48:19,385 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-01-21 02:48:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 02:48:19,509 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-01-21 02:48:19,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 02:48:19,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 02:48:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 02:48:19,511 INFO L225 Difference]: With dead ends: 35 [2018-01-21 02:48:19,511 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 02:48:19,512 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 02:48:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 02:48:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 02:48:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 02:48:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 02:48:19,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 02:48:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 02:48:19,513 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 02:48:19,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 02:48:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 02:48:19,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 02:48:19,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 02:48:19 BoogieIcfgContainer [2018-01-21 02:48:19,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 02:48:19,520 INFO L168 Benchmark]: Toolchain (without parser) took 1795.56 ms. Allocated memory was 306.7 MB in the beginning and 467.1 MB in the end (delta: 160.4 MB). Free memory was 264.9 MB in the beginning and 374.8 MB in the end (delta: -109.9 MB). Peak memory consumption was 50.5 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:19,522 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 306.7 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 02:48:19,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.42 ms. Allocated memory is still 306.7 MB. Free memory was 263.9 MB in the beginning and 253.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:19,522 INFO L168 Benchmark]: Boogie Preprocessor took 28.22 ms. Allocated memory is still 306.7 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:19,523 INFO L168 Benchmark]: RCFGBuilder took 216.25 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 236.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:19,523 INFO L168 Benchmark]: TraceAbstraction took 1343.16 ms. Allocated memory was 306.7 MB in the beginning and 467.1 MB in the end (delta: 160.4 MB). Free memory was 235.9 MB in the beginning and 374.8 MB in the end (delta: -138.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-21 02:48:19,525 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.19 ms. Allocated memory is still 306.7 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.42 ms. Allocated memory is still 306.7 MB. Free memory was 263.9 MB in the beginning and 253.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.22 ms. Allocated memory is still 306.7 MB. Free memory was 253.9 MB in the beginning and 251.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 216.25 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 236.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1343.16 ms. Allocated memory was 306.7 MB in the beginning and 467.1 MB in the end (delta: 160.4 MB). Free memory was 235.9 MB in the beginning and 374.8 MB in the end (delta: -138.9 MB). Peak memory consumption was 21.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: - 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: bubbleSortErr0EnsuresViolation CFG has 4 procedures, 39 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 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=39occurred 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: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 10 NumberOfFragments, 8 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 39 locations, 4 error locations. UNSAFE Result, 0.0s 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=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L554] int array_size = __VERIFIER_nondet_int(); [L555] COND TRUE array_size < 1 || array_size >= 2147483647 / sizeof(int) [L556] array_size = 1 VAL [array_size=1] [L558] EXPR, FCALL __builtin_alloca (array_size * sizeof(int)) VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1] [L558] int* numbers = (int*) __builtin_alloca (array_size * sizeof(int)); VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1, numbers={6:0}] [L559] CALL bubbleSort(numbers, array_size) VAL [\old(array_size)=1, numbers={6:0}] [L542] int i, j, temp; [L543] i = (array_size - 1) VAL [\old(array_size)=1, array_size=1, i=0, numbers={6:0}, numbers={6:0}] [L543] COND TRUE i >= 0 [L544] j = 1 VAL [\old(array_size)=1, array_size=1, i=0, j=1, numbers={6:0}, numbers={6:0}] [L544] COND FALSE !(j <= i) VAL [\old(array_size)=1, array_size=1, i=0, j=1, numbers={6:0}, numbers={6:0}] [L543] i-- VAL [\old(array_size)=1, array_size=1, i=-1, j=1, numbers={6:0}, numbers={6:0}] [L543] COND FALSE, RET !(i >= 0) VAL [\old(array_size)=1, array_size=1, i=-1, j=1, numbers={6:0}, numbers={6:0}] [L559] bubbleSort(numbers, array_size) VAL [__builtin_alloca (array_size * sizeof(int))={6:0}, array_size=1, numbers={6:0}] [L560] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 39 locations, 4 error locations. UNSAFE Result, 0.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 73 SDtfs, 21 SDslu, 84 SDs, 0 SdLazy, 26 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=39occurred 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, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 1121 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: 553]: 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, 39 locations, 4 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 101 SDtfs, 42 SDslu, 82 SDs, 0 SdLazy, 63 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=39occurred 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, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 2662 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 - InvariantResult [Line: 544]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_02-48-19-535.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_02-48-19-535.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_02-48-19-535.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_02-48-19-535.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_02-48-19-535.csv Received shutdown request...