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/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:32:15,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:32:15,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:32:15,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:32:15,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:32:15,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:32:15,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:32:15,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:32:15,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:32:15,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:32:15,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:32:15,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:32:15,309 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:32:15,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:32:15,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:32:15,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:32:15,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:32:15,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:32:15,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:32:15,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:32:15,324 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:32:15,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:32:15,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:32:15,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:32:15,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:32:15,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:32:15,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:32:15,329 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:32:15,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:32:15,330 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:32:15,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:32:15,331 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:32:15,342 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:32:15,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:32:15,343 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:32:15,343 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:32:15,343 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:32:15,343 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:32:15,344 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:32:15,344 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:32:15,344 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:32:15,345 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:32:15,345 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:32:15,345 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:32:15,345 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:32:15,345 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:32:15,346 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:32:15,346 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:32:15,346 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:32:15,346 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:32:15,346 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:32:15,347 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:32:15,347 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:32:15,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:32:15,347 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:32:15,347 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:32:15,347 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:32:15,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:32:15,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:32:15,348 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:32:15,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:32:15,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:32:15,349 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:32:15,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:32:15,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:32:15,349 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:32:15,349 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:32:15,350 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:32:15,350 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:32:15,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:32:15,399 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:32:15,403 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:32:15,405 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:32:15,405 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:32:15,406 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-25 02:32:15,609 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:32:15,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:32:15,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:32:15,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:32:15,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:32:15,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f336ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15, skipping insertion in model container [2018-01-25 02:32:15,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,643 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:32:15,684 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:32:15,799 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:32:15,815 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:32:15,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15 WrapperNode [2018-01-25 02:32:15,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:32:15,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:32:15,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:32:15,824 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:32:15,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (1/1) ... [2018-01-25 02:32:15,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:32:15,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:32:15,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:32:15,859 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:32:15,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (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-25 02:32:15,915 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:32:15,915 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:32:15,915 INFO L136 BoogieDeclarations]: Found implementation of procedure bubbleSort [2018-01-25 02:32:15,916 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure bubbleSort [2018-01-25 02:32:15,916 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:32:15,917 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:32:15,917 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:32:16,231 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:32:16,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:32:16 BoogieIcfgContainer [2018-01-25 02:32:16,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:32:16,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:32:16,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:32:16,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:32:16,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:32:15" (1/3) ... [2018-01-25 02:32:16,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106ce896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:32:16, skipping insertion in model container [2018-01-25 02:32:16,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:32:15" (2/3) ... [2018-01-25 02:32:16,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106ce896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:32:16, skipping insertion in model container [2018-01-25 02:32:16,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:32:16" (3/3) ... [2018-01-25 02:32:16,239 INFO L105 eAbstractionObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:32:16,247 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:32:16,253 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-25 02:32:16,304 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:32:16,304 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:32:16,304 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:32:16,304 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:32:16,304 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:32:16,304 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:32:16,304 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:32:16,305 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:32:16,305 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:32:16,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-25 02:32:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:32:16,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:16,348 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:16,349 INFO L371 AbstractCegarLoop]: === Iteration 1 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:32:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash 334121063, now seen corresponding path program 1 times [2018-01-25 02:32:16,354 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:16,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:16,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:16,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:16,399 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:16,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:16,602 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-25 02:32:16,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:16,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:32:16,605 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:16,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:32:16,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:32:16,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:32:16,628 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-01-25 02:32:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:16,929 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2018-01-25 02:32:16,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:32:16,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-25 02:32:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:16,944 INFO L225 Difference]: With dead ends: 79 [2018-01-25 02:32:16,945 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 02:32:16,949 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:32:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 02:32:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-25 02:32:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-25 02:32:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-25 02:32:16,992 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-01-25 02:32:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:16,993 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-25 02:32:16,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:32:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-25 02:32:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:32:16,994 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:16,994 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:16,994 INFO L371 AbstractCegarLoop]: === Iteration 2 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:32:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 334121064, now seen corresponding path program 1 times [2018-01-25 02:32:16,995 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:16,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:16,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:16,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:16,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:17,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:17,210 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-25 02:32:17,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:17,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:32:17,211 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:17,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:32:17,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:32:17,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:32:17,216 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 8 states. [2018-01-25 02:32:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:17,452 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-25 02:32:17,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:32:17,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-25 02:32:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:17,457 INFO L225 Difference]: With dead ends: 62 [2018-01-25 02:32:17,457 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 02:32:17,458 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:32:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 02:32:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-01-25 02:32:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:32:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 02:32:17,468 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 16 [2018-01-25 02:32:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:17,468 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 02:32:17,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:32:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 02:32:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:32:17,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:17,470 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-25 02:32:17,470 INFO L371 AbstractCegarLoop]: === Iteration 3 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:32:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1789385763, now seen corresponding path program 1 times [2018-01-25 02:32:17,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:17,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:17,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:17,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:17,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:17,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:17,537 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-25 02:32:17,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:17,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:32:17,538 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:17,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:32:17,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:32:17,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:32:17,539 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-25 02:32:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:17,650 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-01-25 02:32:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:32:17,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 02:32:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:17,654 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:32:17,654 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 02:32:17,655 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-25 02:32:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 02:32:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 52. [2018-01-25 02:32:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:32:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-25 02:32:17,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 19 [2018-01-25 02:32:17,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:17,665 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-25 02:32:17,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:32:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-25 02:32:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:32:17,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:17,667 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:17,667 INFO L371 AbstractCegarLoop]: === Iteration 4 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:32:17,667 INFO L82 PathProgramCache]: Analyzing trace with hash -120775682, now seen corresponding path program 1 times [2018-01-25 02:32:17,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:17,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:17,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:17,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:17,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:17,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:32:17,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:17,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:32:17,795 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:17,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:32:17,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:32:17,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:32:17,796 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-25 02:32:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:17,894 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-25 02:32:17,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:32:17,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 02:32:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:17,895 INFO L225 Difference]: With dead ends: 58 [2018-01-25 02:32:17,896 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:32:17,896 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:32:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:32:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2018-01-25 02:32:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 02:32:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-01-25 02:32:17,902 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2018-01-25 02:32:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:17,903 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-01-25 02:32:17,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:32:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-01-25 02:32:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:32:17,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:17,904 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:32:17,904 INFO L371 AbstractCegarLoop]: === Iteration 5 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:32:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash 550921116, now seen corresponding path program 1 times [2018-01-25 02:32:17,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:17,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:17,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:17,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:17,905 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:17,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 02:32:18,040 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:32:18,040 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:32:18,045 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 02:32:18,046 INFO L201 CegarAbsIntRunner]: [0], [4], [9], [13], [18], [19], [22], [24], [43], [45], [54], [55], [59], [64], [66], [67], [74], [75], [76], [78] [2018-01-25 02:32:18,098 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:32:18,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:32:18,674 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:32:18,675 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 02:32:18,705 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:32:18,705 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:32:18,706 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:32:18,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:18,728 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:32:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:18,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:32:18,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 02:32:18,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:32:18,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:32:18,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:32:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 02:32:19,104 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:32:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 02:32:19,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:32:19,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:32:19,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:19,489 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:32:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:19,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:32:19,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 02:32:19,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:32:19,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:32:19,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:32:19,854 WARN L143 SmtUtils]: Spent 234ms on a formula simplification that was a NOOP. DAG size: 15 [2018-01-25 02:32:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 02:32:19,965 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:32:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 02:32:20,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:32:20,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 23 [2018-01-25 02:32:20,056 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:32:20,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 02:32:20,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 02:32:20,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-01-25 02:32:20,057 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 14 states. [2018-01-25 02:32:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:20,334 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-01-25 02:32:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:32:20,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-01-25 02:32:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:20,335 INFO L225 Difference]: With dead ends: 40 [2018-01-25 02:32:20,336 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 02:32:20,336 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-01-25 02:32:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 02:32:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-01-25 02:32:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-25 02:32:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-01-25 02:32:20,344 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 23 [2018-01-25 02:32:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:20,344 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-01-25 02:32:20,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 02:32:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-01-25 02:32:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:32:20,345 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:32:20,345 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-25 02:32:20,345 INFO L371 AbstractCegarLoop]: === Iteration 6 === [bubbleSortErr7RequiresViolation, bubbleSortErr11RequiresViolation, bubbleSortErr0RequiresViolation, bubbleSortErr3RequiresViolation, bubbleSortErr9RequiresViolation, bubbleSortErr1RequiresViolation, bubbleSortErr2RequiresViolation, bubbleSortErr8RequiresViolation, bubbleSortErr6RequiresViolation, bubbleSortErr10RequiresViolation, bubbleSortErr4RequiresViolation, bubbleSortErr5RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:32:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash -996967546, now seen corresponding path program 1 times [2018-01-25 02:32:20,346 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:32:20,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:20,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:32:20,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:32:20,347 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:32:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:32:20,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:32:20,414 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-25 02:32:20,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:32:20,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:32:20,414 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:32:20,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:32:20,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:32:20,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:32:20,416 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 4 states. [2018-01-25 02:32:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:32:20,454 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-01-25 02:32:20,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:32:20,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-25 02:32:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:32:20,455 INFO L225 Difference]: With dead ends: 35 [2018-01-25 02:32:20,455 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 02:32:20,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:32:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 02:32:20,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 02:32:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 02:32:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 02:32:20,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-25 02:32:20,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:32:20,457 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 02:32:20,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:32:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 02:32:20,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 02:32:20,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 02:32:20,686 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 61 DAG size of output 46 [2018-01-25 02:32:20,919 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 62 DAG size of output 38 [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr2RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 550) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr3RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 551) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr1RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,940 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr4RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr0RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr10RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L397 ceAbstractionStarter]: At program point L543'''(lines 543 551) the Hoare annotation is: (or (and (and (= bubbleSort_~numbers.offset 0) (= 1 (select |#valid| bubbleSort_~numbers.base))) (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| bubbleSort_~numbers.base)) (<= (+ bubbleSort_~i~2 1) v_main_~array_size~6_BEFORE_CALL_2)))) (not (= (select |#valid| |bubbleSort_#in~numbers.base|) 1)) (not (= 0 |bubbleSort_#in~numbers.offset|)) (not (exists ((v_main_~array_size~6_BEFORE_CALL_3 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_3) (select |#length| |bubbleSort_#in~numbers.base|)) (<= |bubbleSort_#in~array_size| v_main_~array_size~6_BEFORE_CALL_3))))) [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr6RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point L543''(lines 543 551) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-25 02:32:20,941 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 550) the Hoare annotation is: (or (let ((.cse0 (= bubbleSort_~numbers.offset 0)) (.cse1 (= 1 (select |#valid| bubbleSort_~numbers.base))) (.cse2 (exists ((v_main_~array_size~6_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_2) (select |#length| bubbleSort_~numbers.base)) (<= (+ bubbleSort_~i~2 1) v_main_~array_size~6_BEFORE_CALL_2))))) (or (and .cse0 (= bubbleSort_~j~2 1) .cse1 .cse2) (let ((.cse3 (+ (* 4 bubbleSort_~j~2) bubbleSort_~numbers.offset))) (and .cse0 (<= 8 .cse3) (<= .cse3 (select |#length| bubbleSort_~numbers.base)) .cse1 .cse2)))) (not (= (select |#valid| |bubbleSort_#in~numbers.base|) 1)) (not (= 0 |bubbleSort_#in~numbers.offset|)) (not (exists ((v_main_~array_size~6_BEFORE_CALL_3 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_3) (select |#length| |bubbleSort_#in~numbers.base|)) (<= |bubbleSort_#in~array_size| v_main_~array_size~6_BEFORE_CALL_3))))) [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr7RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point L543''''(lines 543 551) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr8RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr9RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point bubbleSortEXIT(lines 540 552) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr5RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point bubbleSortErr11RequiresViolation(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point L544''(lines 544 550) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L404 ceAbstractionStarter]: At program point bubbleSortENTRY(lines 540 552) the Hoare annotation is: true [2018-01-25 02:32:20,942 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,942 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:32:20,943 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,943 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 561) the Hoare annotation is: true [2018-01-25 02:32:20,943 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,943 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 561) the Hoare annotation is: true [2018-01-25 02:32:20,943 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 561) no Hoare annotation was computed. [2018-01-25 02:32:20,943 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 553 561) no Hoare annotation was computed. [2018-01-25 02:32:20,943 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-25 02:32:20,943 INFO L397 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~6))) (and (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (= 0 main_~numbers~6.offset) (<= 1 main_~array_size~6) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= 1 (select |#valid| main_~numbers~6.base)) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= .cse0 (select |#length| main_~numbers~6.base)))) [2018-01-25 02:32:20,943 INFO L401 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-25 02:32:20,943 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 553 561) no Hoare annotation was computed. [2018-01-25 02:32:20,943 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 553 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:32:20,944 INFO L401 ceAbstractionStarter]: For program point L558''(line 558) no Hoare annotation was computed. [2018-01-25 02:32:20,944 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-25 02:32:20,944 INFO L401 ceAbstractionStarter]: For program point L555''(lines 555 557) no Hoare annotation was computed. [2018-01-25 02:32:20,944 INFO L401 ceAbstractionStarter]: For program point L559'(line 559) no Hoare annotation was computed. [2018-01-25 02:32:20,944 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 553 561) no Hoare annotation was computed. [2018-01-25 02:32:20,949 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,951 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,951 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,951 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,952 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,954 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,959 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,960 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,961 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,964 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,965 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,966 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,968 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,969 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:32:20 BoogieIcfgContainer [2018-01-25 02:32:20,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:32:20,971 INFO L168 Benchmark]: Toolchain (without parser) took 5361.81 ms. Allocated memory was 296.7 MB in the beginning and 504.9 MB in the end (delta: 208.1 MB). Free memory was 255.1 MB in the beginning and 469.9 MB in the end (delta: -214.8 MB). Peak memory consumption was 168.4 MB. Max. memory is 5.3 GB. [2018-01-25 02:32:20,972 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 296.7 MB. Free memory is still 261.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:32:20,973 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.50 ms. Allocated memory is still 296.7 MB. Free memory was 254.1 MB in the beginning and 243.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:32:20,973 INFO L168 Benchmark]: Boogie Preprocessor took 34.42 ms. Allocated memory is still 296.7 MB. Free memory was 243.8 MB in the beginning and 242.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-25 02:32:20,973 INFO L168 Benchmark]: RCFGBuilder took 373.94 ms. Allocated memory is still 296.7 MB. Free memory was 242.8 MB in the beginning and 225.1 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:32:20,974 INFO L168 Benchmark]: TraceAbstraction took 4737.66 ms. Allocated memory was 296.7 MB in the beginning and 504.9 MB in the end (delta: 208.1 MB). Free memory was 225.1 MB in the beginning and 469.9 MB in the end (delta: -244.8 MB). Peak memory consumption was 138.5 MB. Max. memory is 5.3 GB. [2018-01-25 02:32:20,976 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 296.7 MB. Free memory is still 261.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.50 ms. Allocated memory is still 296.7 MB. Free memory was 254.1 MB in the beginning and 243.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.42 ms. Allocated memory is still 296.7 MB. Free memory was 243.8 MB in the beginning and 242.8 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 373.94 ms. Allocated memory is still 296.7 MB. Free memory was 242.8 MB in the beginning and 225.1 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4737.66 ms. Allocated memory was 296.7 MB in the beginning and 504.9 MB in the end (delta: 208.1 MB). Free memory was 225.1 MB in the beginning and 469.9 MB in the end (delta: -244.8 MB). Peak memory consumption was 138.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 161 LocStat_NO_SUPPORTING_DISEQUALITIES : 14 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.834198 RENAME_VARIABLES(MILLISECONDS) : 0.366303 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.789839 PROJECTAWAY(MILLISECONDS) : 0.273308 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.180956 DISJOIN(MILLISECONDS) : 1.940096 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.396864 ADD_EQUALITY(MILLISECONDS) : 0.044636 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.054003 #CONJOIN_DISJUNCTIVE : 41 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 69 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-01-25 02:32:20,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,984 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,985 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,985 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,986 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,987 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,988 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,988 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,988 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,989 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,989 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,990 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((numbers == 0 && j == 1) && 1 == \valid[numbers]) && (\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[numbers] && i + 1 <= v_main_~array_size~6_BEFORE_CALL_2)) || ((((numbers == 0 && 8 <= 4 * j + numbers) && 4 * j + numbers <= unknown-#length-unknown[numbers]) && 1 == \valid[numbers]) && (\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[numbers] && i + 1 <= v_main_~array_size~6_BEFORE_CALL_2))) || !(\valid[numbers] == 1)) || !(0 == numbers)) || !(\exists v_main_~array_size~6_BEFORE_CALL_3 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_3 == unknown-#length-unknown[numbers] && \old(array_size) <= v_main_~array_size~6_BEFORE_CALL_3) - InvariantResult [Line: 543]: Loop Invariant [2018-01-25 02:32:20,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,991 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,992 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,992 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,993 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:32:20,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,994 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_3,QUANTIFIED] [2018-01-25 02:32:20,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:32:20,994 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((numbers == 0 && 1 == \valid[numbers]) && (\exists v_main_~array_size~6_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_2 == unknown-#length-unknown[numbers] && i + 1 <= v_main_~array_size~6_BEFORE_CALL_2)) || !(\valid[numbers] == 1)) || !(0 == numbers)) || !(\exists v_main_~array_size~6_BEFORE_CALL_3 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_3 == unknown-#length-unknown[numbers] && \old(array_size) <= v_main_~array_size~6_BEFORE_CALL_3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. SAFE Result, 4.6s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 348 SDslu, 389 SDs, 0 SdLazy, 414 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 53 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 11 NumberOfFragments, 187 HoareAnnotationTreeSize, 8 FomulaSimplifications, 215 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 325 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 202 ConstructedInterpolants, 52 QuantifiedInterpolants, 37569 SizeOfPredicates, 20 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 15/25 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-32-20-999.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-32-20-999.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-32-20-999.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubblesort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-32-20-999.csv Received shutdown request...