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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 09:48:33,553 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 09:48:33,555 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 09:48:33,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 09:48:33,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 09:48:33,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 09:48:33,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 09:48:33,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 09:48:33,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 09:48:33,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 09:48:33,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 09:48:33,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 09:48:33,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 09:48:33,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 09:48:33,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 09:48:33,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 09:48:33,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 09:48:33,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 09:48:33,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 09:48:33,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 09:48:33,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 09:48:33,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 09:48:33,583 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 09:48:33,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 09:48:33,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 09:48:33,586 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 09:48:33,586 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 09:48:33,587 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 09:48:33,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 09:48:33,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 09:48:33,587 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 09:48:33,588 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf
[2018-02-02 09:48:33,597 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 09:48:33,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 09:48:33,598 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 09:48:33,598 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 09:48:33,599 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 09:48:33,599 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 09:48:33,599 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 09:48:33,599 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 09:48:33,599 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 09:48:33,599 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 09:48:33,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 09:48:33,600 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 09:48:33,600 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 09:48:33,600 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 09:48:33,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 09:48:33,600 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 09:48:33,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 09:48:33,601 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 09:48:33,601 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 09:48:33,601 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 09:48:33,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:48:33,601 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 09:48:33,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation
[2018-02-02 09:48:33,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 09:48:33,640 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 09:48:33,643 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 09:48:33,644 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 09:48:33,644 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 09:48:33,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i
[2018-02-02 09:48:33,767 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 09:48:33,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 09:48:33,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 09:48:33,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 09:48:33,775 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 09:48:33,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcbc08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33, skipping insertion in model container
[2018-02-02 09:48:33,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,793 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:48:33,822 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:48:33,912 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:48:33,923 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:48:33,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33 WrapperNode
[2018-02-02 09:48:33,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 09:48:33,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 09:48:33,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 09:48:33,929 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 09:48:33,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
[2018-02-02 09:48:33,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 09:48:33,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 09:48:33,957 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 09:48:33,957 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 09:48:33,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (1/1) ...
No working directory specified, using /home/ultimate/work/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-02-02 09:48:33,995 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 09:48:33,995 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 09:48:33,995 INFO L136 BoogieDeclarations]: Found implementation of procedure sort
[2018-02-02 09:48:33,996 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure sort
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 09:48:33,996 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 09:48:34,131 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 09:48:34,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:48:34 BoogieIcfgContainer
[2018-02-02 09:48:34,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 09:48:34,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 09:48:34,132 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 09:48:34,134 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 09:48:34,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:48:33" (1/3) ...
[2018-02-02 09:48:34,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551e1b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:48:34, skipping insertion in model container
[2018-02-02 09:48:34,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:48:33" (2/3) ...
[2018-02-02 09:48:34,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551e1b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:48:34, skipping insertion in model container
[2018-02-02 09:48:34,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:48:34" (3/3) ...
[2018-02-02 09:48:34,136 INFO L107 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i
[2018-02-02 09:48:34,141 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION
[2018-02-02 09:48:34,145 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations.
[2018-02-02 09:48:34,173 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 09:48:34,174 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 09:48:34,174 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation
[2018-02-02 09:48:34,174 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL
[2018-02-02 09:48:34,174 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 09:48:34,174 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 09:48:34,174 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 09:48:34,174 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 09:48:34,175 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 09:48:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states.
[2018-02-02 09:48:34,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 09:48:34,194 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:34,195 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:34,196 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1780471319, now seen corresponding path program 1 times
[2018-02-02 09:48:34,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:34,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:48:34,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:48:34,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,341 INFO L182 omatonBuilderFactory]: Interpolants [51#true, 52#false, 53#(= 1 (select |#valid| |main_#t~malloc9.base|)), 54#(= 1 (select |#valid| main_~numbers~0.base)), 55#(= 1 (select |#valid| |sort_#in~x.base|)), 56#(= 1 (select |#valid| sort_~x.base))]
[2018-02-02 09:48:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:48:34,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:48:34,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:48:34,356 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states.
[2018-02-02 09:48:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:34,494 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions.
[2018-02-02 09:48:34,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:48:34,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2018-02-02 09:48:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:34,571 INFO L225 Difference]: With dead ends: 42
[2018-02-02 09:48:34,572 INFO L226 Difference]: Without dead ends: 39
[2018-02-02 09:48:34,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:48:34,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2018-02-02 09:48:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2018-02-02 09:48:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2018-02-02 09:48:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions.
[2018-02-02 09:48:34,596 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16
[2018-02-02 09:48:34,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:34,596 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions.
[2018-02-02 09:48:34,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:48:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions.
[2018-02-02 09:48:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 09:48:34,596 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:34,597 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:34,597 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1780471318, now seen corresponding path program 1 times
[2018-02-02 09:48:34,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:34,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:48:34,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:48:34,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,671 INFO L182 omatonBuilderFactory]: Interpolants [144#(<= main_~array_size~0 1), 145#(<= |sort_#in~n| 1), 146#(and (= sort_~pass~0 1) (<= sort_~n 1)), 147#(and (= sort_~pass~0 1) (= sort_~i~0 0) (<= sort_~n 1)), 142#true, 143#false]
[2018-02-02 09:48:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:48:34,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:48:34,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:48:34,673 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states.
[2018-02-02 09:48:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:34,707 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions.
[2018-02-02 09:48:34,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:48:34,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2018-02-02 09:48:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:34,708 INFO L225 Difference]: With dead ends: 52
[2018-02-02 09:48:34,708 INFO L226 Difference]: Without dead ends: 52
[2018-02-02 09:48:34,709 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:48:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-02-02 09:48:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47.
[2018-02-02 09:48:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2018-02-02 09:48:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions.
[2018-02-02 09:48:34,712 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16
[2018-02-02 09:48:34,712 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:34,712 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions.
[2018-02-02 09:48:34,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:48:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions.
[2018-02-02 09:48:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-02 09:48:34,712 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:34,713 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:34,713 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2121468968, now seen corresponding path program 1 times
[2018-02-02 09:48:34,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:34,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:48:34,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 09:48:34,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,795 INFO L182 omatonBuilderFactory]: Interpolants [256#(and (= sort_~x.offset 0) (= sort_~i~0 0) (<= 4 (select |#length| sort_~x.base))), 249#true, 250#false, 251#(<= 1 main_~array_size~0), 252#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (<= 1 main_~array_size~0)), 253#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base)) (<= 1 main_~array_size~0)), 254#(and (<= 4 (select |#length| |sort_#in~x.base|)) (= 0 |sort_#in~x.offset|)), 255#(and (= sort_~x.offset 0) (<= 4 (select |#length| sort_~x.base)))]
[2018-02-02 09:48:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:34,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 09:48:34,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 09:48:34,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:48:34,796 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 8 states.
[2018-02-02 09:48:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:34,927 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions.
[2018-02-02 09:48:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:48:34,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2018-02-02 09:48:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:34,930 INFO L225 Difference]: With dead ends: 67
[2018-02-02 09:48:34,930 INFO L226 Difference]: Without dead ends: 67
[2018-02-02 09:48:34,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2018-02-02 09:48:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-02 09:48:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56.
[2018-02-02 09:48:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-02-02 09:48:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions.
[2018-02-02 09:48:34,934 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16
[2018-02-02 09:48:34,934 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:34,934 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions.
[2018-02-02 09:48:34,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 09:48:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions.
[2018-02-02 09:48:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 09:48:34,935 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:34,935 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:34,935 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1341028550, now seen corresponding path program 1 times
[2018-02-02 09:48:34,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:34,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:48:35,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 09:48:35,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,030 INFO L182 omatonBuilderFactory]: Interpolants [386#true, 387#false, 388#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 389#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 390#(and (= 0 |sort_#in~x.offset|) (<= (* 4 |sort_#in~n|) (select |#length| |sort_#in~x.base|))), 391#(and (= sort_~pass~0 1) (= sort_~x.offset 0) (<= (* 4 sort_~n) (select |#length| sort_~x.base))), 392#(and (= sort_~x.offset 0) (<= (+ (* 4 sort_~i~0) 8) (select |#length| sort_~x.base))), 393#(and (<= 0 (+ sort_~x.offset (* 4 sort_~i~0))) (= sort_~x.offset 0) (<= (+ (* 4 sort_~i~0) 8) (select |#length| sort_~x.base)))]
[2018-02-02 09:48:35,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 09:48:35,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 09:48:35,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:48:35,031 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 8 states.
[2018-02-02 09:48:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:35,211 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions.
[2018-02-02 09:48:35,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 09:48:35,211 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17
[2018-02-02 09:48:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:35,212 INFO L225 Difference]: With dead ends: 101
[2018-02-02 09:48:35,212 INFO L226 Difference]: Without dead ends: 101
[2018-02-02 09:48:35,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:48:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2018-02-02 09:48:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87.
[2018-02-02 09:48:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2018-02-02 09:48:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions.
[2018-02-02 09:48:35,217 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 17
[2018-02-02 09:48:35,217 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:35,217 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions.
[2018-02-02 09:48:35,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 09:48:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions.
[2018-02-02 09:48:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 09:48:35,217 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:35,217 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:35,217 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash 232335457, now seen corresponding path program 1 times
[2018-02-02 09:48:35,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:35,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:48:35,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:48:35,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,255 INFO L182 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(= |#valid| |old(#valid)|), 595#(= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|)]
[2018-02-02 09:48:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:48:35,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:48:35,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:48:35,256 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand 4 states.
[2018-02-02 09:48:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:35,303 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions.
[2018-02-02 09:48:35,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:48:35,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2018-02-02 09:48:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:35,305 INFO L225 Difference]: With dead ends: 86
[2018-02-02 09:48:35,305 INFO L226 Difference]: Without dead ends: 72
[2018-02-02 09:48:35,305 INFO L554 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-02-02 09:48:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2018-02-02 09:48:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2018-02-02 09:48:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2018-02-02 09:48:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions.
[2018-02-02 09:48:35,310 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 19
[2018-02-02 09:48:35,311 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:35,311 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions.
[2018-02-02 09:48:35,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:48:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions.
[2018-02-02 09:48:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 09:48:35,311 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:35,312 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:35,312 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:35,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1939327170, now seen corresponding path program 1 times
[2018-02-02 09:48:35,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:35,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:48:35,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:48:35,373 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,374 INFO L182 omatonBuilderFactory]: Interpolants [756#true, 757#false, 758#(<= 0 (+ sort_~x.offset (* 4 sort_~i~0))), 759#(and (<= 0 (+ sort_~x.offset (* 4 sort_~i~0))) (<= (+ sort_~x.offset (* 4 sort_~i~0) 8) (select |#length| sort_~x.base))), 760#(and (<= (+ sort_~x.offset (* 4 sort_~i~0) 4) (select |#length| sort_~x.base)) (<= 4 (+ sort_~x.offset (* 4 sort_~i~0))))]
[2018-02-02 09:48:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:48:35,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:48:35,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:48:35,375 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 5 states.
[2018-02-02 09:48:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:35,416 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions.
[2018-02-02 09:48:35,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:48:35,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22
[2018-02-02 09:48:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:35,417 INFO L225 Difference]: With dead ends: 83
[2018-02-02 09:48:35,417 INFO L226 Difference]: Without dead ends: 83
[2018-02-02 09:48:35,417 INFO L554 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-02-02 09:48:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-02 09:48:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50.
[2018-02-02 09:48:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-02 09:48:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions.
[2018-02-02 09:48:35,419 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 22
[2018-02-02 09:48:35,419 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:35,420 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions.
[2018-02-02 09:48:35,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:48:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions.
[2018-02-02 09:48:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 09:48:35,420 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:35,420 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:35,420 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 733703231, now seen corresponding path program 1 times
[2018-02-02 09:48:35,421 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:35,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 09:48:35,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:48:35,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:48:35,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,455 INFO L182 omatonBuilderFactory]: Interpolants [896#true, 897#false, 898#(and (= sort_~i~0 0) (<= (+ sort_~pass~0 1) sort_~n))]
[2018-02-02 09:48:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 09:48:35,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:48:35,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:48:35,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:48:35,455 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 3 states.
[2018-02-02 09:48:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:35,472 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions.
[2018-02-02 09:48:35,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 09:48:35,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28
[2018-02-02 09:48:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:35,473 INFO L225 Difference]: With dead ends: 66
[2018-02-02 09:48:35,473 INFO L226 Difference]: Without dead ends: 66
[2018-02-02 09:48:35,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:48:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2018-02-02 09:48:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45.
[2018-02-02 09:48:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2018-02-02 09:48:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions.
[2018-02-02 09:48:35,475 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 28
[2018-02-02 09:48:35,476 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:35,476 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions.
[2018-02-02 09:48:35,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:48:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions.
[2018-02-02 09:48:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 09:48:35,476 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:48:35,476 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:48:35,476 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, sortErr7RequiresViolation, sortErr11RequiresViolation, sortErr0RequiresViolation, sortErr3RequiresViolation, sortErr9RequiresViolation, sortErr1RequiresViolation, sortErr2RequiresViolation, sortErr8RequiresViolation, sortErr10RequiresViolation, sortErr6RequiresViolation, sortErr4RequiresViolation, sortErr5RequiresViolation]===
[2018-02-02 09:48:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 149814891, now seen corresponding path program 2 times
[2018-02-02 09:48:35,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy
[2018-02-02 09:48:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:48:35,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:48:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:48:35,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7
[2018-02-02 09:48:35,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state
[2018-02-02 09:48:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,540 INFO L182 omatonBuilderFactory]: Interpolants [1010#true, 1011#false, 1012#(<= (+ sort_~x.offset (* 4 sort_~i~0) 8) (select |#length| sort_~x.base)), 1013#(<= (+ sort_~x.offset (* 4 sort_~i~0) 4) (select |#length| sort_~x.base)), 1014#(<= (+ sort_~x.offset (* 4 sort_~n) 4) (+ (* 4 sort_~pass~0) (select |#length| sort_~x.base))), 1015#(<= (+ sort_~x.offset (* 4 sort_~n) 8) (+ (* 4 sort_~pass~0) (select |#length| sort_~x.base))), 1016#(<= (+ sort_~x.offset (* 4 sort_~i~0) 12) (select |#length| sort_~x.base)), 1017#(and (<= 0 (+ sort_~x.offset (* 4 sort_~i~0))) (<= (+ sort_~x.offset (* 4 sort_~i~0) 12) (select |#length| sort_~x.base)))]
[2018-02-02 09:48:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:48:35,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 09:48:35,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 09:48:35,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:48:35,540 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 8 states.
[2018-02-02 09:48:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:48:35,640 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions.
[2018-02-02 09:48:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:48:35,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28
[2018-02-02 09:48:35,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:48:35,641 INFO L225 Difference]: With dead ends: 48
[2018-02-02 09:48:35,641 INFO L226 Difference]: Without dead ends: 0
[2018-02-02 09:48:35,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:48:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-02-02 09:48:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-02-02 09:48:35,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-02-02 09:48:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-02-02 09:48:35,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28
[2018-02-02 09:48:35,642 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:48:35,642 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-02-02 09:48:35,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 09:48:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-02-02 09:48:35,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-02-02 09:48:35,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:48:35 BoogieIcfgContainer
[2018-02-02 09:48:35,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 09:48:35,648 INFO L168 Benchmark]: Toolchain (without parser) took 1879.84 ms. Allocated memory was 394.8 MB in the beginning and 615.5 MB in the end (delta: 220.7 MB). Free memory was 353.0 MB in the beginning and 563.2 MB in the end (delta: -210.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 5.3 GB.
[2018-02-02 09:48:35,649 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 394.8 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:48:35,649 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.93 ms. Allocated memory is still 394.8 MB. Free memory was 351.7 MB in the beginning and 341.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
[2018-02-02 09:48:35,649 INFO L168 Benchmark]: Boogie Preprocessor took 27.81 ms. Allocated memory is still 394.8 MB. Free memory was 341.1 MB in the beginning and 339.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 09:48:35,649 INFO L168 Benchmark]: RCFGBuilder took 174.64 ms. Allocated memory is still 394.8 MB. Free memory was 339.8 MB in the beginning and 321.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB.
[2018-02-02 09:48:35,649 INFO L168 Benchmark]: TraceAbstraction took 1515.38 ms. Allocated memory was 394.8 MB in the beginning and 615.5 MB in the end (delta: 220.7 MB). Free memory was 321.7 MB in the beginning and 563.2 MB in the end (delta: -241.5 MB). There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:48:35,650 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.13 ms. Allocated memory is still 394.8 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 158.93 ms. Allocated memory is still 394.8 MB. Free memory was 351.7 MB in the beginning and 341.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 27.81 ms. Allocated memory is still 394.8 MB. Free memory was 341.1 MB in the beginning and 339.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 174.64 ms. Allocated memory is still 394.8 MB. Free memory was 339.8 MB in the beginning and 321.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 1515.38 ms. Allocated memory was 394.8 MB in the beginning and 615.5 MB in the end (delta: 220.7 MB). Free memory was 321.7 MB in the beginning and 563.2 MB in the end (delta: -241.5 MB). There was no memory consumed. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 549]: all allocated memory was freed
For all program executions holds that all allocated memory was freed 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: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- AllSpecificationsHoldResult: All specifications hold
13 specifications checked. All of them hold
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 48 locations, 13 error locations. SAFE Result, 1.4s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 453 SDslu, 413 SDs, 0 SdLazy, 459 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 21/23 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 13599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 21/23 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-48-35-657.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-48-35-657.csv
Received shutdown request...