java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:49:48,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:49:48,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:49:48,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:49:48,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:49:48,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:49:48,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:49:48,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:49:48,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:49:48,048 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:49:48,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:49:48,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:49:48,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:49:48,050 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:49:48,050 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:49:48,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:49:48,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:49:48,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:49:48,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:49:48,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:49:48,062 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:49:48,062 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:49:48,062 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:49:48,063 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:49:48,064 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:49:48,065 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:49:48,065 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:49:48,066 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:49:48,066 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:49:48,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:49:48,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:49:48,067 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:49:48,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:49:48,077 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:49:48,077 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:49:48,078 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:49:48,078 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:49:48,078 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:49:48,078 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:49:48,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:49:48,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:49:48,079 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:49:48,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:49:48,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:49:48,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:49:48,080 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:49:48,080 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:49:48,080 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:49:48,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:49:48,081 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:49:48,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:49:48,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:49:48,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:49:48,081 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:49:48,082 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:49:48,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:49:48,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:49:48,082 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:49:48,082 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:49:48,083 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:49:48,083 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:49:48,083 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:49:48,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:49:48,083 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:49:48,084 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:49:48,084 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:49:48,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:49:48,130 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:49:48,135 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:49:48,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:49:48,137 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:49:48,137 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-24 12:49:48,310 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:49:48,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:49:48,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:49:48,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:49:48,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:49:48,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319d8693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48, skipping insertion in model container [2018-01-24 12:49:48,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:49:48,404 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:49:48,511 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:49:48,525 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:49:48,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48 WrapperNode [2018-01-24 12:49:48,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:49:48,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:49:48,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:49:48,533 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:49:48,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (1/1) ... [2018-01-24 12:49:48,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:49:48,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:49:48,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:49:48,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:49:48,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (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-24 12:49:48,610 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:49:48,610 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:49:48,610 INFO L136 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-01-24 12:49:48,611 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:49:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:49:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:49:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:49:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:49:48,611 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:49:48,612 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:49:48,612 INFO L128 BoogieDeclarations]: Found specification of procedure insertionSort [2018-01-24 12:49:48,612 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:49:48,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:49:48,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:49:48,805 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:49:48,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:49:48 BoogieIcfgContainer [2018-01-24 12:49:48,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:49:48,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:49:48,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:49:48,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:49:48,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:49:48" (1/3) ... [2018-01-24 12:49:48,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6671d410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:49:48, skipping insertion in model container [2018-01-24 12:49:48,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:48" (2/3) ... [2018-01-24 12:49:48,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6671d410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:49:48, skipping insertion in model container [2018-01-24 12:49:48,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:49:48" (3/3) ... [2018-01-24 12:49:48,811 INFO L105 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:49:48,817 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:49:48,823 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 12:49:48,871 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:49:48,871 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:49:48,871 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:49:48,871 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:49:48,872 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:49:48,872 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:49:48,872 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:49:48,872 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:49:48,873 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:49:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 12:49:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:49:48,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:48,900 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:48,900 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:48,905 INFO L82 PathProgramCache]: Analyzing trace with hash 243546787, now seen corresponding path program 1 times [2018-01-24 12:49:48,909 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:48,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:48,952 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:48,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:48,952 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:49,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:49,115 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-24 12:49:49,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:49,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:49:49,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:49,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:49:49,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:49:49,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:49:49,138 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2018-01-24 12:49:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:49,385 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-01-24 12:49:49,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:49:49,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-24 12:49:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:49,397 INFO L225 Difference]: With dead ends: 76 [2018-01-24 12:49:49,398 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 12:49:49,401 INFO L525 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-24 12:49:49,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 12:49:49,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 12:49:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 12:49:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 12:49:49,440 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-24 12:49:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:49,440 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 12:49:49,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:49:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 12:49:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:49:49,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:49,441 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:49,441 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash 243546788, now seen corresponding path program 1 times [2018-01-24 12:49:49,442 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:49,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:49,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:49,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:49,443 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:49,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:49,615 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-24 12:49:49,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:49,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:49:49,617 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:49,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:49:49,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:49:49,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:49:49,619 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-01-24 12:49:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:49,833 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-24 12:49:49,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:49:49,833 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 12:49:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:49,837 INFO L225 Difference]: With dead ends: 60 [2018-01-24 12:49:49,837 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:49:49,838 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:49:49,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:49:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-01-24 12:49:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:49:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 12:49:49,846 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-01-24 12:49:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:49,847 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 12:49:49,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:49:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 12:49:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:49:49,848 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:49,848 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:49,848 INFO L371 AbstractCegarLoop]: === Iteration 3 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1724462409, now seen corresponding path program 1 times [2018-01-24 12:49:49,848 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:49,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:49,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:49,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:49,850 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:49,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:49,936 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-24 12:49:49,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:49,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:49:49,936 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:49,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:49:49,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:49:49,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:49:49,937 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-01-24 12:49:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:50,131 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-01-24 12:49:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:49:50,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 12:49:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:50,132 INFO L225 Difference]: With dead ends: 81 [2018-01-24 12:49:50,132 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 12:49:50,133 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:49:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 12:49:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2018-01-24 12:49:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:49:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 12:49:50,141 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2018-01-24 12:49:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:50,141 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 12:49:50,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:49:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 12:49:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:49:50,142 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:50,142 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:50,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1435415779, now seen corresponding path program 1 times [2018-01-24 12:49:50,142 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:50,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:50,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,144 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:50,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:50,201 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-24 12:49:50,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:50,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:49:50,202 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:50,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:49:50,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:49:50,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:49:50,203 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 4 states. [2018-01-24 12:49:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:50,276 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-01-24 12:49:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:49:50,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 12:49:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:50,277 INFO L225 Difference]: With dead ends: 48 [2018-01-24 12:49:50,277 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:49:50,278 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:49:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:49:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 12:49:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:49:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-24 12:49:50,283 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 19 [2018-01-24 12:49:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:50,283 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-24 12:49:50,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:49:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-24 12:49:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:49:50,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:50,284 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:50,284 INFO L371 AbstractCegarLoop]: === Iteration 5 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1918733159, now seen corresponding path program 1 times [2018-01-24 12:49:50,284 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:50,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:50,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,285 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:50,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:50,324 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-24 12:49:50,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:50,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:49:50,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:50,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:49:50,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:49:50,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:49:50,325 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-24 12:49:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:50,397 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-01-24 12:49:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:49:50,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 12:49:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:50,400 INFO L225 Difference]: With dead ends: 90 [2018-01-24 12:49:50,400 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:49:50,401 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:49:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:49:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-01-24 12:49:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:49:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 12:49:50,408 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-01-24 12:49:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:50,409 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 12:49:50,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:49:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 12:49:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 12:49:50,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:50,410 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:50,410 INFO L371 AbstractCegarLoop]: === Iteration 6 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:50,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1355765508, now seen corresponding path program 1 times [2018-01-24 12:49:50,410 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:50,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:50,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,412 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:50,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:50,516 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-24 12:49:50,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:50,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:49:50,516 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:50,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:49:50,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:49:50,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:49:50,517 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-01-24 12:49:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:50,671 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-24 12:49:50,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:49:50,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 12:49:50,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:50,672 INFO L225 Difference]: With dead ends: 68 [2018-01-24 12:49:50,672 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 12:49:50,673 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:49:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 12:49:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-24 12:49:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 12:49:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 12:49:50,681 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2018-01-24 12:49:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:50,681 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 12:49:50,681 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:49:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 12:49:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:49:50,682 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:50,683 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:50,683 INFO L371 AbstractCegarLoop]: === Iteration 7 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash 461327576, now seen corresponding path program 1 times [2018-01-24 12:49:50,683 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:50,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:50,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:50,685 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:50,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:50,831 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-24 12:49:50,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:50,832 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:49:50,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:50,842 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:50,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:50,915 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-24 12:49:50,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:50,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:49:50,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:49:51,098 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-24 12:49:51,099 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:51,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:51,345 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:49:51,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:51,349 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:51,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:51,378 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-24 12:49:51,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:51,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:49:51,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 12:49:51,425 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-24 12:49:51,426 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:51,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:49:51,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-24 12:49:51,526 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:49:51,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:49:51,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:49:51,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:49:51,528 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-01-24 12:49:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:51,864 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-24 12:49:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:49:51,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-01-24 12:49:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:51,865 INFO L225 Difference]: With dead ends: 58 [2018-01-24 12:49:51,865 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 12:49:51,866 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:49:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 12:49:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-01-24 12:49:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 12:49:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 12:49:51,872 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2018-01-24 12:49:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:51,872 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 12:49:51,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:49:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 12:49:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:49:51,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:51,873 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:51,873 INFO L371 AbstractCegarLoop]: === Iteration 8 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2040783234, now seen corresponding path program 1 times [2018-01-24 12:49:51,873 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:51,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:51,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:51,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:51,874 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:51,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:51,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:51,925 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 12:49:51,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:51,931 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:51,947 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:51,958 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-24 12:49:51,959 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:51,993 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-24 12:49:52,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:52,013 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:49:52,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:52,016 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:52,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:52,048 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-24 12:49:52,048 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:52,089 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-24 12:49:52,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:49:52,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 8 [2018-01-24 12:49:52,092 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:49:52,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:49:52,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:49:52,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:49:52,092 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2018-01-24 12:49:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:52,228 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-01-24 12:49:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:49:52,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-24 12:49:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:52,230 INFO L225 Difference]: With dead ends: 79 [2018-01-24 12:49:52,230 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:49:52,231 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:49:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:49:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-01-24 12:49:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 12:49:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 12:49:52,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-01-24 12:49:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:52,242 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 12:49:52,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:49:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 12:49:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:49:52,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:52,243 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:52,243 INFO L371 AbstractCegarLoop]: === Iteration 9 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1160223154, now seen corresponding path program 1 times [2018-01-24 12:49:52,244 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:52,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:52,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:52,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:52,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:52,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:52,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:52,435 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 12:49:52,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:52,444 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:52,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:52,757 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-24 12:49:52,757 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:52,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 12:49:52,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:52,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-24 12:49:52,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:53,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:49:53,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:31 [2018-01-24 12:49:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:53,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:53,131 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:49:53,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:53,140 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:53,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:53,605 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:53,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-24 12:49:53,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:53,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-01-24 12:49:53,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:53,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:49:53,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:30 [2018-01-24 12:49:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:53,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:49:53,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 10, 10] total 38 [2018-01-24 12:49:53,840 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:49:53,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:49:53,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:49:53,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:49:53,841 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 21 states. [2018-01-24 12:49:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:54,722 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-01-24 12:49:54,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 12:49:54,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 12:49:54,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:54,724 INFO L225 Difference]: With dead ends: 89 [2018-01-24 12:49:54,724 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 12:49:54,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=578, Invalid=2392, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 12:49:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 12:49:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-01-24 12:49:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:49:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 12:49:54,736 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 28 [2018-01-24 12:49:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:54,736 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 12:49:54,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 12:49:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 12:49:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:49:54,737 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:54,737 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:54,737 INFO L371 AbstractCegarLoop]: === Iteration 10 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 12:49:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2127039869, now seen corresponding path program 1 times [2018-01-24 12:49:54,738 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:54,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:54,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:54,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:54,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:54,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:54,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:54,951 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:49:54,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:54,960 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:54,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:55,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:55,143 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:49:55,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:55,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-01-24 12:49:55,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:55,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:49:55,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:7 [2018-01-24 12:49:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:55,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:49:55,291 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:49:55,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:55,294 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:49:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:55,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:49:55,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:55,393 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:49:55,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 12:49:55,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:49:55,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:49:55,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:7 [2018-01-24 12:49:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:55,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:49:55,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 8, 8] total 28 [2018-01-24 12:49:55,442 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:49:55,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:49:55,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:49:55,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2018-01-24 12:49:55,443 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 18 states. [2018-01-24 12:49:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:49:55,807 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 12:49:55,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:49:55,807 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-24 12:49:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:49:55,807 INFO L225 Difference]: With dead ends: 75 [2018-01-24 12:49:55,807 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 12:49:55,808 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 12:49:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 12:49:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 12:49:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 12:49:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 12:49:55,809 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 12:49:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:49:55,809 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 12:49:55,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:49:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 12:49:55,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 12:49:55,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 12:49:55,833 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 12:49:56,310 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 88 DAG size of output 55 [2018-01-24 12:49:56,780 WARN L146 SmtUtils]: Spent 468ms on a formula simplification. DAG size of input: 81 DAG size of output 55 [2018-01-24 12:49:56,783 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L546''''''(lines 546 547) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point insertionSortErr8RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point insertionSortErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point insertionSortErr9RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,784 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point L543'''(lines 543 549) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L397 ceAbstractionStarter]: At program point L546'''''''(lines 546 547) the Hoare annotation is: (let ((.cse9 (* 4 insertionSort_~i~2))) (let ((.cse8 (select |#length| insertionSort_~a.base)) (.cse2 (<= 4 (+ insertionSort_~a.offset .cse9))) (.cse5 (select |#valid| |insertionSort_#in~a.base|)) (.cse0 (= 1 (select |#valid| insertionSort_~a.base))) (.cse4 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_1))))) (let ((.cse6 (<= 0 insertionSort_~j~2)) (.cse7 (and .cse2 (= 1 .cse5) .cse0 .cse4)) (.cse3 (<= (+ insertionSort_~a.offset .cse9 4) .cse8)) (.cse1 (= insertionSort_~a.offset 0))) (or (and .cse0 (= insertionSort_~j~2 1) .cse1 .cse2 .cse3 .cse4) (not (= .cse5 1)) (and .cse6 (<= 2 insertionSort_~i~2) .cse7 .cse3 .cse1 (<= (+ (* 4 insertionSort_~j~2) 4) .cse8)) (and .cse6 (<= insertionSort_~j~2 0) .cse7 .cse3 .cse1) (< (select |#length| |insertionSort_#in~a.base|) 4) (not (= 0 |insertionSort_#in~a.offset|)) (not (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |insertionSort_#in~a.base|))))))))) [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point insertionSortErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L397 ceAbstractionStarter]: At program point L543''(lines 543 549) the Hoare annotation is: (let ((.cse1 (= 1 (select |#valid| insertionSort_~a.base))) (.cse2 (= 0 insertionSort_~a.offset)) (.cse3 (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_1)))) (.cse0 (select |#length| insertionSort_~a.base))) (or (and (<= 4 .cse0) .cse1 .cse2 (= 1 insertionSort_~i~2) .cse3) (not (= (select |#valid| |insertionSort_#in~a.base|) 1)) (and (let ((.cse4 (<= 2 insertionSort_~i~2))) (or (and .cse1 (<= 0 insertionSort_~j~2) (<= insertionSort_~j~2 0) .cse2 .cse4 .cse3) (and .cse1 (< 0 insertionSort_~j~2) .cse2 .cse4 (<= (+ (* 4 insertionSort_~j~2) 4) .cse0) .cse3))) (<= (+ insertionSort_~a.offset (* 4 insertionSort_~i~2)) .cse0)) (< (select |#length| |insertionSort_#in~a.base|) 4) (not (= 0 |insertionSort_#in~a.offset|)) (not (exists ((v_main_~array_size~5_BEFORE_CALL_1 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_1) (= (* 4 v_main_~array_size~5_BEFORE_CALL_1) (select |#length| |insertionSort_#in~a.base|))))))) [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point insertionSortEXIT(lines 540 550) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point insertionSortErr7RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point L546''''''''(lines 546 547) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-24 12:49:56,785 INFO L401 ceAbstractionStarter]: For program point insertionSortErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point insertionSortErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point insertionSortErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L404 ceAbstractionStarter]: At program point insertionSortENTRY(lines 540 550) the Hoare annotation is: true [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point insertionSortErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point insertionSortErr6RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 12:49:56,786 INFO L401 ceAbstractionStarter]: For program point L553(lines 553 555) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L397 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= 0 |main_#t~malloc9.offset|) (= 1 (select |#valid| main_~a~5.base)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= .cse0 (select |#length| main_~a~5.base)) (= 0 main_~a~5.offset) (<= 1 main_~array_size~5) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= .cse0 (select |#length| |main_#t~malloc9.base|)))) [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 551 559) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 551 559) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 551 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point L553''(lines 553 555) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 12:49:56,787 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 551 559) no Hoare annotation was computed. [2018-01-24 12:49:56,794 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,795 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,796 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,797 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,799 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,800 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,806 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,807 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,808 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,808 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,809 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,810 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,813 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,814 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,815 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,815 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,816 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,817 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,818 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,819 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,820 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,820 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,820 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,820 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,821 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,822 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:49:56 BoogieIcfgContainer [2018-01-24 12:49:56,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:49:56,826 INFO L168 Benchmark]: Toolchain (without parser) took 8514.74 ms. Allocated memory was 305.7 MB in the beginning and 561.5 MB in the end (delta: 255.9 MB). Free memory was 264.4 MB in the beginning and 449.5 MB in the end (delta: -185.1 MB). Peak memory consumption was 178.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:49:56,828 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 305.7 MB. Free memory is still 270.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:49:56,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.19 ms. Allocated memory is still 305.7 MB. Free memory was 264.4 MB in the beginning and 254.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:49:56,828 INFO L168 Benchmark]: Boogie Preprocessor took 33.98 ms. Allocated memory is still 305.7 MB. Free memory was 254.3 MB in the beginning and 252.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:49:56,829 INFO L168 Benchmark]: RCFGBuilder took 239.12 ms. Allocated memory is still 305.7 MB. Free memory was 252.3 MB in the beginning and 235.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:49:56,829 INFO L168 Benchmark]: TraceAbstraction took 8018.47 ms. Allocated memory was 305.7 MB in the beginning and 561.5 MB in the end (delta: 255.9 MB). Free memory was 235.2 MB in the beginning and 449.5 MB in the end (delta: -214.3 MB). Peak memory consumption was 149.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:49:56,831 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.23 ms. Allocated memory is still 305.7 MB. Free memory is still 270.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 185.19 ms. Allocated memory is still 305.7 MB. Free memory was 264.4 MB in the beginning and 254.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.98 ms. Allocated memory is still 305.7 MB. Free memory was 254.3 MB in the beginning and 252.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 239.12 ms. Allocated memory is still 305.7 MB. Free memory was 252.3 MB in the beginning and 235.2 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8018.47 ms. Allocated memory was 305.7 MB in the beginning and 561.5 MB in the end (delta: 255.9 MB). Free memory was 235.2 MB in the beginning and 449.5 MB in the end (delta: -214.3 MB). Peak memory consumption was 149.1 MB. Max. memory is 5.3 GB. * 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_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,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 * 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: 546]: Loop Invariant [2018-01-24 12:49:56,838 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,839 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,840 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,841 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,842 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,844 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,845 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,846 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,847 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,848 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((1 == \valid[a] && j == 1) && a == 0) && 4 <= a + 4 * i) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) || !(\valid[a] == 1)) || (((((0 <= j && 2 <= i) && ((4 <= a + 4 * i && 1 == \valid[a]) && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && a == 0) && 4 * j + 4 <= unknown-#length-unknown[a])) || ((((0 <= j && j <= 0) && ((4 <= a + 4 * i && 1 == \valid[a]) && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && a == 0)) || unknown-#length-unknown[a] < 4) || !(0 == a)) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a]) - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 12:49:56,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,850 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,851 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,852 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,852 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,853 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,855 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,856 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,857 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_1,QUANTIFIED] [2018-01-24 12:49:56,857 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,857 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,857 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,857 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,858 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,858 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,858 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 12:49:56,858 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((4 <= unknown-#length-unknown[a] && 1 == \valid[a]) && 0 == a) && 1 == i) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) || !(\valid[a] == 1)) || (((((((1 == \valid[a] && 0 <= j) && j <= 0) && 0 == a) && 2 <= i) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1)) || (((((1 == \valid[a] && 0 < j) && 0 == a) && 2 <= i) && 4 * j + 4 <= unknown-#length-unknown[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_1))) && a + 4 * i <= unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4) || !(0 == a)) || !(\exists v_main_~array_size~5_BEFORE_CALL_1 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_1 && 4 * v_main_~array_size~5_BEFORE_CALL_1 == unknown-#length-unknown[a]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 11 error locations. SAFE Result, 7.9s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 252 SDtfs, 1128 SDslu, 957 SDs, 0 SdLazy, 1185 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 365 SyntacticMatches, 18 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 142 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 17 NumberOfFragments, 365 HoareAnnotationTreeSize, 8 FomulaSimplifications, 11784 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1703 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 624 ConstructedInterpolants, 126 QuantifiedInterpolants, 153373 SizeOfPredicates, 44 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 36/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-49-56-864.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-49-56-864.csv Received shutdown request...