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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 01:05:27,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:05:27,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:05:27,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:05:27,232 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:05:27,233 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:05:27,234 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:05:27,236 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:05:27,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:05:27,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:05:27,239 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:05:27,239 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:05:27,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:05:27,240 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:05:27,241 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:05:27,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:05:27,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:05:27,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:05:27,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:05:27,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:05:27,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:05:27,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:05:27,254 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:05:27,255 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:05:27,256 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:05:27,257 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:05:27,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:05:27,258 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:05:27,258 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:05:27,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:05:27,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:05:27,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:05:27,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:05:27,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:05:27,270 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:05:27,271 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:05:27,271 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:05:27,271 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:05:27,271 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:05:27,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:05:27,272 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:05:27,272 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 01:05:27,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:05:27,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:05:27,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:05:27,273 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 01:05:27,273 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 01:05:27,274 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 01:05:27,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:05:27,274 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:05:27,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:05:27,274 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:05:27,275 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:05:27,275 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:05:27,275 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:05:27,275 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:05:27,275 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:05:27,276 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:05:27,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:05:27,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:05:27,276 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:05:27,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:05:27,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:05:27,277 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:05:27,278 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:05:27,278 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:05:27,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:05:27,327 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:05:27,331 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:05:27,332 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:05:27,333 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:05:27,334 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-30 01:05:27,512 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:05:27,518 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 01:05:27,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:05:27,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:05:27,524 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:05:27,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521999d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27, skipping insertion in model container [2018-01-30 01:05:27,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,546 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:05:27,587 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:05:27,710 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:05:27,727 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:05:27,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27 WrapperNode [2018-01-30 01:05:27,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:05:27,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:05:27,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:05:27,736 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:05:27,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (1/1) ... [2018-01-30 01:05:27,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:05:27,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:05:27,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:05:27,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:05:27,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (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-30 01:05:27,836 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:05:27,836 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:05:27,836 INFO L136 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-01-30 01:05:27,836 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:05:27,836 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 01:05:27,837 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 01:05:27,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 01:05:27,837 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 01:05:27,837 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 01:05:27,837 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:05:27,837 INFO L128 BoogieDeclarations]: Found specification of procedure insertionSort [2018-01-30 01:05:27,837 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:05:27,838 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:05:27,838 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:05:28,094 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:05:28,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:05:28 BoogieIcfgContainer [2018-01-30 01:05:28,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:05:28,095 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 01:05:28,095 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 01:05:28,096 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 01:05:28,099 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:05:28" (1/1) ... [2018-01-30 01:05:28,106 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 01:05:28,106 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 01:05:28,107 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 01:05:28,146 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 7 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 01:05:28,178 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 01:05:28,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 01:05:54,382 INFO L311 AbstractInterpreter]: Visited 74 different actions 699 times. Merged at 45 different actions 429 times. Widened at 3 different actions 12 times. Found 56 fixpoints after 11 different actions. Largest state had 46 variables. [2018-01-30 01:05:54,384 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 01:05:54,393 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 5 [2018-01-30 01:05:54,393 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 01:05:54,394 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 01:05:54,394 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_5| v_insertionSort_~a.base_12), at (SUMMARY for call write~int(#t~mem6, ~a.base, ~a.offset + ~j~2 * 4, 4); srcloc: L547')) ((select |v_#memory_int_7| v_insertionSort_~a.base_15), at (SUMMARY for call write~int(~index~2, ~a.base, ~a.offset + ~j~2 * 4, 4); srcloc: L546'''''''''''''''')) ((select (select |v_#memory_int_3| v_insertionSort_~a.base_9) (+ (* 4 v_insertionSort_~j~2_7) v_insertionSort_~a.offset_7 (- 4))), at (SUMMARY for call #t~mem6 := read~int(~a.base, ~a.offset + (~j~2 - 1) * 4, 4); srcloc: L547)) ((select (select |v_#memory_int_1| v_insertionSort_~a.base_3) (+ v_insertionSort_~a.offset_3 (* 4 v_insertionSort_~i~2_8))), at (SUMMARY for call #t~mem1 := read~int(~a.base, ~a.offset + ~i~2 * 4, 4); srcloc: L545)) ((select (select |v_#memory_int_2| v_insertionSort_~a.base_6) (+ (* 4 v_insertionSort_~j~2_5) v_insertionSort_~a.offset_5 (- 4))), at (SUMMARY for call #t~mem3 := read~int(~a.base, ~a.offset + (~j~2 - 1) * 4, 4); srcloc: L546''')) [2018-01-30 01:05:54,424 INFO L547 PartitionManager]: partitioning result: [2018-01-30 01:05:54,424 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 01:05:54,424 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 01:05:54,424 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:05:54,424 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:05:54,424 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 01:05:54,425 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-01-30 01:05:54,425 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 01:05:54,425 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 01:05:54,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:05:54 BasicIcfg [2018-01-30 01:05:54,441 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 01:05:54,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:05:54,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:05:54,446 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:05:54,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:05:27" (1/4) ... [2018-01-30 01:05:54,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200460f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:05:54, skipping insertion in model container [2018-01-30 01:05:54,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:05:27" (2/4) ... [2018-01-30 01:05:54,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200460f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:05:54, skipping insertion in model container [2018-01-30 01:05:54,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:05:28" (3/4) ... [2018-01-30 01:05:54,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6200460f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:05:54, skipping insertion in model container [2018-01-30 01:05:54,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 01:05:54" (4/4) ... [2018-01-30 01:05:54,450 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 01:05:54,511 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:05:54,541 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-30 01:05:54,606 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:05:54,606 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:05:54,606 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:05:54,607 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:05:54,607 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:05:54,607 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:05:54,607 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:05:54,607 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:05:54,608 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:05:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-30 01:05:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-30 01:05:54,625 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:54,626 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:54,626 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1544779554, now seen corresponding path program 1 times [2018-01-30 01:05:54,631 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:54,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:54,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:54,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:54,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:54,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:54,866 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-30 01:05:54,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:54,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:05:54,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:05:54,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:05:54,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:05:54,885 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 4 states. [2018-01-30 01:05:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:55,106 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-01-30 01:05:55,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 01:05:55,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-30 01:05:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:55,121 INFO L225 Difference]: With dead ends: 111 [2018-01-30 01:05:55,122 INFO L226 Difference]: Without dead ends: 56 [2018-01-30 01:05:55,126 INFO L553 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-30 01:05:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-30 01:05:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-30 01:05:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 01:05:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-30 01:05:55,163 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 13 [2018-01-30 01:05:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:55,163 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-30 01:05:55,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:05:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-30 01:05:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 01:05:55,164 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:55,165 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:55,165 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash -460324219, now seen corresponding path program 1 times [2018-01-30 01:05:55,165 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:55,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:55,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:55,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:55,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:55,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:55,419 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-30 01:05:55,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:55,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:05:55,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:05:55,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:05:55,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:05:55,422 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-01-30 01:05:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:55,733 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-01-30 01:05:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:05:55,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-30 01:05:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:55,735 INFO L225 Difference]: With dead ends: 91 [2018-01-30 01:05:55,735 INFO L226 Difference]: Without dead ends: 90 [2018-01-30 01:05:55,736 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:05:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-30 01:05:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2018-01-30 01:05:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-30 01:05:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2018-01-30 01:05:55,743 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 18 [2018-01-30 01:05:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:55,743 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-01-30 01:05:55,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:05:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2018-01-30 01:05:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-30 01:05:55,745 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:55,745 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:55,745 INFO L371 AbstractCegarLoop]: === Iteration 3 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -460324221, now seen corresponding path program 1 times [2018-01-30 01:05:55,745 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:55,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:55,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:55,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:55,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:55,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:55,791 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-30 01:05:55,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:55,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:05:55,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:05:55,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:05:55,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:05:55,793 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand 6 states. [2018-01-30 01:05:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:55,867 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-01-30 01:05:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:05:55,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-30 01:05:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:55,868 INFO L225 Difference]: With dead ends: 59 [2018-01-30 01:05:55,869 INFO L226 Difference]: Without dead ends: 54 [2018-01-30 01:05:55,869 INFO L553 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-01-30 01:05:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-30 01:05:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-30 01:05:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-30 01:05:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-30 01:05:55,876 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 18 [2018-01-30 01:05:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:55,877 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-30 01:05:55,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:05:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-30 01:05:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 01:05:55,878 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:55,878 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:55,878 INFO L371 AbstractCegarLoop]: === Iteration 4 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash 801009154, now seen corresponding path program 1 times [2018-01-30 01:05:55,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:55,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:55,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:55,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:55,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:55,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:55,989 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-30 01:05:55,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:55,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 01:05:55,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 01:05:55,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 01:05:55,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-30 01:05:55,991 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 9 states. [2018-01-30 01:05:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:56,207 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-30 01:05:56,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 01:05:56,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-30 01:05:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:56,209 INFO L225 Difference]: With dead ends: 110 [2018-01-30 01:05:56,209 INFO L226 Difference]: Without dead ends: 108 [2018-01-30 01:05:56,209 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:05:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-30 01:05:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2018-01-30 01:05:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 01:05:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-30 01:05:56,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 25 [2018-01-30 01:05:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:56,219 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-30 01:05:56,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 01:05:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-30 01:05:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 01:05:56,220 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:56,220 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:56,220 INFO L371 AbstractCegarLoop]: === Iteration 5 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash 27723163, now seen corresponding path program 1 times [2018-01-30 01:05:56,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:56,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:56,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:56,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:56,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:56,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:56,272 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-30 01:05:56,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:56,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:05:56,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:05:56,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:05:56,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:05:56,274 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 5 states. [2018-01-30 01:05:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:56,336 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-01-30 01:05:56,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 01:05:56,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-30 01:05:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:56,338 INFO L225 Difference]: With dead ends: 143 [2018-01-30 01:05:56,338 INFO L226 Difference]: Without dead ends: 108 [2018-01-30 01:05:56,339 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:05:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-30 01:05:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2018-01-30 01:05:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-30 01:05:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-30 01:05:56,347 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 28 [2018-01-30 01:05:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:56,348 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-30 01:05:56,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:05:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-30 01:05:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 01:05:56,349 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:56,349 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:56,349 INFO L371 AbstractCegarLoop]: === Iteration 6 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1076856123, now seen corresponding path program 1 times [2018-01-30 01:05:56,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:56,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:56,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:56,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:56,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:56,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:56,434 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-30 01:05:56,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:05:56,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:05:56,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 01:05:56,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 01:05:56,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 01:05:56,435 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 6 states. [2018-01-30 01:05:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:56,500 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-01-30 01:05:56,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 01:05:56,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-30 01:05:56,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:56,501 INFO L225 Difference]: With dead ends: 108 [2018-01-30 01:05:56,502 INFO L226 Difference]: Without dead ends: 106 [2018-01-30 01:05:56,502 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:05:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-30 01:05:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 70. [2018-01-30 01:05:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-30 01:05:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-01-30 01:05:56,510 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 30 [2018-01-30 01:05:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:56,511 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-01-30 01:05:56,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 01:05:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-01-30 01:05:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 01:05:56,512 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:56,512 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:56,512 INFO L371 AbstractCegarLoop]: === Iteration 7 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:56,513 INFO L82 PathProgramCache]: Analyzing trace with hash -213090245, now seen corresponding path program 1 times [2018-01-30 01:05:56,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:56,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:56,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:56,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:56,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:56,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:56,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:05:56,667 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-30 01:05:56,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:56,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:05:56,732 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-30 01:05:56,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:05:56,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:05:56,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:05:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:57,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:05:57,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-01-30 01:05:57,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 01:05:57,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 01:05:57,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-01-30 01:05:57,085 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 18 states. [2018-01-30 01:05:57,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:57,425 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-01-30 01:05:57,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 01:05:57,425 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-01-30 01:05:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:57,426 INFO L225 Difference]: With dead ends: 93 [2018-01-30 01:05:57,426 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 01:05:57,426 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:05:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 01:05:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2018-01-30 01:05:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-30 01:05:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-01-30 01:05:57,434 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 36 [2018-01-30 01:05:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:57,434 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-01-30 01:05:57,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 01:05:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-01-30 01:05:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-30 01:05:57,436 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:57,436 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:57,436 INFO L371 AbstractCegarLoop]: === Iteration 8 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash 673848632, now seen corresponding path program 1 times [2018-01-30 01:05:57,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:57,437 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:57,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:57,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:57,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:57,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:57,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:05:57,501 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:05:57,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:57,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:05:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:57,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:05:57,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-01-30 01:05:57,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 01:05:57,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 01:05:57,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-30 01:05:57,616 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 10 states. [2018-01-30 01:05:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:57,749 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-01-30 01:05:57,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 01:05:57,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-30 01:05:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:57,751 INFO L225 Difference]: With dead ends: 130 [2018-01-30 01:05:57,752 INFO L226 Difference]: Without dead ends: 100 [2018-01-30 01:05:57,752 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-01-30 01:05:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-30 01:05:57,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 77. [2018-01-30 01:05:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 01:05:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-30 01:05:57,762 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 39 [2018-01-30 01:05:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:57,762 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-30 01:05:57,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 01:05:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-30 01:05:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 01:05:57,764 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:57,764 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:57,764 INFO L371 AbstractCegarLoop]: === Iteration 9 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:57,765 INFO L82 PathProgramCache]: Analyzing trace with hash -50232667, now seen corresponding path program 1 times [2018-01-30 01:05:57,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:57,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:57,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:57,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:57,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:57,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:57,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:05:57,909 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:05:57,914 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:57,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:05:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:58,373 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:05:58,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2018-01-30 01:05:58,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-30 01:05:58,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-30 01:05:58,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-01-30 01:05:58,374 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 22 states. [2018-01-30 01:05:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:05:59,154 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-30 01:05:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-30 01:05:59,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-01-30 01:05:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:05:59,155 INFO L225 Difference]: With dead ends: 138 [2018-01-30 01:05:59,155 INFO L226 Difference]: Without dead ends: 107 [2018-01-30 01:05:59,155 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1290, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 01:05:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-30 01:05:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 80. [2018-01-30 01:05:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-30 01:05:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-01-30 01:05:59,163 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 42 [2018-01-30 01:05:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:05:59,164 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-01-30 01:05:59,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-30 01:05:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-01-30 01:05:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 01:05:59,165 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:05:59,165 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:05:59,165 INFO L371 AbstractCegarLoop]: === Iteration 10 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:05:59,166 INFO L82 PathProgramCache]: Analyzing trace with hash 578893708, now seen corresponding path program 1 times [2018-01-30 01:05:59,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:05:59,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:05:59,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:59,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:59,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:05:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:59,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:05:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:59,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:05:59,326 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:05:59,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:05:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:05:59,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:05:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:05:59,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:05:59,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-01-30 01:05:59,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:05:59,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:05:59,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:05:59,570 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 19 states. [2018-01-30 01:06:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:06:00,015 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2018-01-30 01:06:00,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 01:06:00,015 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-01-30 01:06:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:06:00,016 INFO L225 Difference]: With dead ends: 125 [2018-01-30 01:06:00,016 INFO L226 Difference]: Without dead ends: 121 [2018-01-30 01:06:00,017 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2018-01-30 01:06:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-30 01:06:00,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-01-30 01:06:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-30 01:06:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-30 01:06:00,026 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 43 [2018-01-30 01:06:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:06:00,026 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-30 01:06:00,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:06:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-30 01:06:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 01:06:00,027 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:06:00,027 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:06:00,027 INFO L371 AbstractCegarLoop]: === Iteration 11 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-30 01:06:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash -702517950, now seen corresponding path program 1 times [2018-01-30 01:06:00,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:06:00,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:06:00,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:06:00,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:06:00,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:06:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:06:00,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:06:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:06:00,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:06:00,167 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:06:00,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:06:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:06:00,194 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:06:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 01:06:00,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 01:06:00,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 16 [2018-01-30 01:06:00,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 01:06:00,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 01:06:00,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-01-30 01:06:00,374 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 17 states. [2018-01-30 01:06:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:06:00,880 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-01-30 01:06:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 01:06:00,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-01-30 01:06:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:06:00,881 INFO L225 Difference]: With dead ends: 128 [2018-01-30 01:06:00,881 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 01:06:00,882 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=1165, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 01:06:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 01:06:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 01:06:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 01:06:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 01:06:00,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-01-30 01:06:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:06:00,883 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 01:06:00,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 01:06:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 01:06:00,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 01:06:00,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 01:06:00,926 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 01:06:00,931 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 01:06:01,042 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 103 DAG size of output 95 [2018-01-30 01:06:02,029 WARN L146 SmtUtils]: Spent 908ms on a formula simplification. DAG size of input: 100 DAG size of output 57 [2018-01-30 01:06:02,333 WARN L146 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 102 DAG size of output 68 [2018-01-30 01:06:02,337 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,337 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L546''''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point insertionSortErr8RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point insertionSortErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L546'''''''''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L546''''''''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 550) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L546''''''''''''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L546'''''''''''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L543''''(line 543) no Hoare annotation was computed. [2018-01-30 01:06:02,338 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L395 ceAbstractionStarter]: At program point L543'''''(lines 543 549) the Hoare annotation is: (let ((.cse1 (= 1 (select |#valid| insertionSort_~a.base))) (.cse2 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| insertionSort_~a.base)) (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_4))))) (or (let ((.cse0 (select |#length| insertionSort_~a.base))) (and (<= (+ insertionSort_~a.offset (* 4 insertionSort_~j~2) 4) .cse0) (and (and (<= 0 insertionSort_~j~2) (<= 2 insertionSort_~i~2) (and (<= 0 insertionSort_~a.offset) (<= (+ insertionSort_~a.offset (* 4 insertionSort_~array_size)) .cse0) .cse1 (<= insertionSort_~a.offset 0)) .cse2) (<= (+ insertionSort_~a.offset (* 4 insertionSort_~i~2)) .cse0)))) (not (= (select |#valid| |insertionSort_#in~a.base|) 1)) (not (= |insertionSort_#in~a.offset| 0)) (not (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |insertionSort_#in~a.base|))))) (and (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_4))) .cse1 .cse2 (= 0 insertionSort_~a.offset) (= 1 insertionSort_~i~2)))) [2018-01-30 01:06:02,339 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L399 ceAbstractionStarter]: For program point L543''''''(lines 543 549) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L399 ceAbstractionStarter]: For program point insertionSortErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L399 ceAbstractionStarter]: For program point insertionSortErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L395 ceAbstractionStarter]: At program point L546'''''''''''''''(lines 546 547) the Hoare annotation is: (let ((.cse6 (= 1 (select |#valid| insertionSort_~a.base))) (.cse7 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| insertionSort_~a.base)) (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_4)))) (.cse8 (* 4 insertionSort_~i~2)) (.cse2 (select |#length| insertionSort_~a.base))) (let ((.cse3 (<= 2 insertionSort_~i~2)) (.cse1 (* 4 insertionSort_~j~2)) (.cse0 (<= 0 insertionSort_~j~2)) (.cse4 (<= (+ insertionSort_~a.offset .cse8 4) .cse2)) (.cse5 (and (<= 4 (+ insertionSort_~a.offset .cse8)) (and (<= 0 insertionSort_~a.offset) (<= (+ insertionSort_~a.offset (* 4 insertionSort_~array_size)) .cse2) .cse6 (<= insertionSort_~a.offset 0)) .cse7))) (or (and .cse0 (<= (+ insertionSort_~a.offset .cse1 8) .cse2) .cse3 .cse4 .cse5) (and .cse3 (<= (+ insertionSort_~a.offset .cse1 4) .cse2) .cse4 .cse5 (<= 2 insertionSort_~j~2)) (and .cse0 (<= insertionSort_~j~2 0) .cse4 .cse5) (not (= (select |#valid| |insertionSort_#in~a.base|) 1)) (not (= |insertionSort_#in~a.offset| 0)) (not (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |insertionSort_#in~a.base|))))) (and (= 1 insertionSort_~j~2) (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_4))) .cse6 (= insertionSort_~i~2 1) .cse7 (= 0 insertionSort_~a.offset) (<= (+ insertionSort_~a.offset 8) .cse2))))) [2018-01-30 01:06:02,339 INFO L399 ceAbstractionStarter]: For program point insertionSortErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,339 INFO L402 ceAbstractionStarter]: At program point insertionSortENTRY(lines 540 550) the Hoare annotation is: true [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point insertionSortErr9RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point insertionSortErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L546'''''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point insertionSortErr6RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L546''''''''''''''''(lines 546 547) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point insertionSortErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L543'(lines 543 549) no Hoare annotation was computed. [2018-01-30 01:06:02,340 INFO L399 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point insertionSortEXIT(lines 540 550) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point insertionSortErr7RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point L546''''''''(line 546) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point L546''''''''''''(lines 546 547) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,341 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-30 01:06:02,341 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L553(lines 553 555) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L395 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= 1 (select |#valid| main_~a~5.base)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (<= 0 |main_#t~malloc9.offset|) (= .cse0 (select |#length| main_~a~5.base)) (<= main_~a~5.offset 0) (<= 0 main_~a~5.offset) (= .cse0 (select |#length| |main_#t~malloc9.base|)) (= |old(#valid)| (store |#valid| |main_#t~malloc9.base| (select (store |#valid| |main_#t~malloc9.base| 0) |main_#t~malloc9.base|))) (<= |main_#t~malloc9.offset| 0))) [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 551 559) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 551 559) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 551 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L553''(lines 553 555) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-30 01:06:02,342 INFO L399 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-30 01:06:02,343 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 551 559) no Hoare annotation was computed. [2018-01-30 01:06:02,347 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,348 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,349 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,351 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,352 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,357 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,358 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,359 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,360 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,362 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,363 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,364 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,364 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,364 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,364 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,364 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,365 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,366 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,369 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,370 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,371 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,372 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,372 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,373 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,373 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,373 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,374 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,374 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,374 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,374 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,375 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,376 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:06:02 BasicIcfg [2018-01-30 01:06:02,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:06:02,379 INFO L168 Benchmark]: Toolchain (without parser) took 34866.94 ms. Allocated memory was 303.0 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 262.9 MB in the beginning and 641.4 MB in the end (delta: -378.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-01-30 01:06:02,380 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:06:02,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.77 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:06:02,381 INFO L168 Benchmark]: Boogie Preprocessor took 37.46 ms. Allocated memory is still 303.0 MB. Free memory was 251.6 MB in the beginning and 250.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-01-30 01:06:02,381 INFO L168 Benchmark]: RCFGBuilder took 321.22 ms. Allocated memory is still 303.0 MB. Free memory was 250.6 MB in the beginning and 230.6 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:06:02,381 INFO L168 Benchmark]: IcfgTransformer took 26346.22 ms. Allocated memory was 303.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 230.6 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 205.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:06:02,382 INFO L168 Benchmark]: TraceAbstraction took 7936.12 ms. Allocated memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: 83.9 MB). Free memory was 1.9 GB in the beginning and 641.4 MB in the end (delta: 1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-30 01:06:02,384 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 303.0 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.77 ms. Allocated memory is still 303.0 MB. Free memory was 261.9 MB in the beginning and 251.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.46 ms. Allocated memory is still 303.0 MB. Free memory was 251.6 MB in the beginning and 250.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 321.22 ms. Allocated memory is still 303.0 MB. Free memory was 250.6 MB in the beginning and 230.6 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 5.3 GB. * IcfgTransformer took 26346.22 ms. Allocated memory was 303.0 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 230.6 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 205.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7936.12 ms. Allocated memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: 83.9 MB). Free memory was 1.9 GB in the beginning and 641.4 MB in the end (delta: 1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 1006 LocStat_NO_SUPPORTING_DISEQUALITIES : 792 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 83 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 128 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 88 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.013804 RENAME_VARIABLES(MILLISECONDS) : 0.610804 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.000543 PROJECTAWAY(MILLISECONDS) : 0.941988 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.086798 DISJOIN(MILLISECONDS) : 0.538112 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.630493 ADD_EQUALITY(MILLISECONDS) : 0.041284 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.028538 #CONJOIN_DISJUNCTIVE : 1267 #RENAME_VARIABLES : 2754 #UNFREEZE : 0 #CONJOIN : 1647 #PROJECTAWAY : 1456 #ADD_WEAK_EQUALITY : 8 #DISJOIN : 425 #RENAME_VARIABLES_DISJUNCTIVE : 2630 #ADD_EQUALITY : 130 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 5 * 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~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,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 - 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 - 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 - 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: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - InvariantResult [Line: 543]: Loop Invariant [2018-01-30 01:06:02,416 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,417 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,417 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,417 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,417 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,417 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,417 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,418 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,418 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,420 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,421 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((a + 4 * j + 4 <= unknown-#length-unknown[a] && (((0 <= j && 2 <= i) && ((0 <= a && a + 4 * array_size <= unknown-#length-unknown[a]) && 1 == \valid[a]) && a <= 0) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4)) && a + 4 * i <= unknown-#length-unknown[a]) || !(\valid[a] == 1)) || !(a == 0)) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) || (((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_4) && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4)) && 0 == a) && 1 == i) - InvariantResult [Line: 546]: Loop Invariant [2018-01-30 01:06:02,423 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,424 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,424 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,424 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,425 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,425 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,425 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,425 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,425 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,426 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,426 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,426 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,426 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,427 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,428 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,429 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,432 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,433 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,434 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-30 01:06:02,435 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,435 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,435 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,435 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,436 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,436 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,436 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,436 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,436 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,437 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,437 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,437 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,437 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,437 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 01:06:02,437 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((0 <= j && a + 4 * j + 8 <= unknown-#length-unknown[a]) && 2 <= i) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && (4 <= a + 4 * i && ((0 <= a && a + 4 * array_size <= unknown-#length-unknown[a]) && 1 == \valid[a]) && a <= 0) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4)) || ((((2 <= i && a + 4 * j + 4 <= unknown-#length-unknown[a]) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && (4 <= a + 4 * i && ((0 <= a && a + 4 * array_size <= unknown-#length-unknown[a]) && 1 == \valid[a]) && a <= 0) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4)) && 2 <= j)) || (((0 <= j && j <= 0) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && (4 <= a + 4 * i && ((0 <= a && a + 4 * array_size <= unknown-#length-unknown[a]) && 1 == \valid[a]) && a <= 0) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4))) || !(\valid[a] == 1)) || !(a == 0)) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) || ((((((1 == j && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_4)) && 1 == \valid[a]) && i == 1) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a] && \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_4)) && 0 == a) && a + 8 <= unknown-#length-unknown[a]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 66 locations, 11 error locations. SAFE Result, 7.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 542 SDtfs, 2439 SDslu, 2537 SDs, 0 SdLazy, 1693 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 186 SyntacticMatches, 3 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 259 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 17 NumberOfFragments, 442 HoareAnnotationTreeSize, 8 FomulaSimplifications, 54306 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 11936 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 550 ConstructedInterpolants, 51 QuantifiedInterpolants, 161299 SizeOfPredicates, 26 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 39/82 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_01-06-02-444.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_01-06-02-444.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_01-06-02-444.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_01-06-02-444.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-06-02-444.csv Received shutdown request...