java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:38:10,324 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:38:10,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:38:10,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:38:10,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:38:10,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:38:10,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:38:10,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:38:10,351 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:38:10,352 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:38:10,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:38:10,353 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:38:10,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:38:10,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:38:10,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:38:10,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:38:10,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:38:10,363 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:38:10,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:38:10,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:38:10,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:38:10,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:38:10,369 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:38:10,370 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:38:10,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:38:10,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:38:10,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:38:10,373 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:38:10,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:38:10,374 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:38:10,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:38:10,375 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:38:10,386 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:38:10,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:38:10,387 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:38:10,387 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:38:10,387 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:38:10,388 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:38:10,388 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:38:10,388 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:38:10,388 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:38:10,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:38:10,389 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:38:10,389 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:38:10,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:38:10,390 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:38:10,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:38:10,390 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:38:10,390 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:38:10,391 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:38:10,391 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:38:10,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:38:10,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:38:10,392 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:38:10,392 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:38:10,392 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:38:10,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:38:10,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:38:10,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:38:10,393 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:38:10,393 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:38:10,393 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:38:10,393 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:38:10,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:38:10,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:38:10,394 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:38:10,394 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:38:10,395 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:38:10,395 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:38:10,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:38:10,445 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:38:10,450 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:38:10,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:38:10,452 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:38:10,453 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-25 02:38:10,637 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:38:10,643 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:38:10,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:38:10,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:38:10,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:38:10,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdf0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10, skipping insertion in model container [2018-01-25 02:38:10,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,672 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:38:10,710 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:38:10,827 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:38:10,843 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:38:10,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10 WrapperNode [2018-01-25 02:38:10,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:38:10,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:38:10,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:38:10,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:38:10,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... [2018-01-25 02:38:10,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:38:10,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:38:10,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:38:10,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:38:10,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:38:10,936 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:38:10,936 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:38:10,936 INFO L136 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-01-25 02:38:10,936 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:38:10,937 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:38:10,937 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:38:10,937 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:38:10,937 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:38:10,937 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:38:10,937 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:38:10,938 INFO L128 BoogieDeclarations]: Found specification of procedure insertionSort [2018-01-25 02:38:10,938 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:38:10,938 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:38:10,938 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:38:11,159 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:38:11,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:38:11 BoogieIcfgContainer [2018-01-25 02:38:11,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:38:11,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:38:11,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:38:11,163 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:38:11,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:38:10" (1/3) ... [2018-01-25 02:38:11,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bef7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:38:11, skipping insertion in model container [2018-01-25 02:38:11,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:38:10" (2/3) ... [2018-01-25 02:38:11,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bef7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:38:11, skipping insertion in model container [2018-01-25 02:38:11,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:38:11" (3/3) ... [2018-01-25 02:38:11,167 INFO L105 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:38:11,174 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:38:11,246 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-25 02:38:11,295 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:38:11,296 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:38:11,296 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:38:11,296 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:38:11,296 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:38:11,296 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:38:11,296 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:38:11,296 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:38:11,297 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:38:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 02:38:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:38:11,327 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:11,329 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:38:11,329 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash 243546787, now seen corresponding path program 1 times [2018-01-25 02:38:11,337 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:11,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:11,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:11,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:11,400 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:11,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:38:11,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:38:11,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:38:11,576 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:38:11,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:38:11,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:38:11,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:38:11,597 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2018-01-25 02:38:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:12,014 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-01-25 02:38:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:38:12,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-25 02:38:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:12,023 INFO L225 Difference]: With dead ends: 76 [2018-01-25 02:38:12,024 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 02:38:12,027 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-25 02:38:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 02:38:12,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-25 02:38:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-25 02:38:12,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-25 02:38:12,069 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-25 02:38:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:12,070 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-25 02:38:12,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:38:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-25 02:38:12,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:38:12,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:12,070 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:38:12,071 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash 243546788, now seen corresponding path program 1 times [2018-01-25 02:38:12,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:12,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:12,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:12,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:12,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:12,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:38:12,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:38:12,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:38:12,280 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:38:12,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:38:12,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:38:12,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:38:12,283 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-01-25 02:38:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:12,493 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-25 02:38:12,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:38:12,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 02:38:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:12,496 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:38:12,497 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:38:12,497 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-25 02:38:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:38:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-01-25 02:38:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:38:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 02:38:12,504 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-01-25 02:38:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:12,504 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 02:38:12,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:38:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 02:38:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:38:12,505 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:12,505 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-25 02:38:12,505 INFO L371 AbstractCegarLoop]: === Iteration 3 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:12,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1724462409, now seen corresponding path program 1 times [2018-01-25 02:38:12,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:12,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:12,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:12,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:12,507 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:12,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:38:12,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:38:12,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:38:12,590 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:38:12,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:38:12,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:38:12,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:38:12,591 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-01-25 02:38:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:12,847 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-01-25 02:38:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:38:12,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 02:38:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:12,850 INFO L225 Difference]: With dead ends: 81 [2018-01-25 02:38:12,850 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 02:38:12,851 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-25 02:38:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 02:38:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2018-01-25 02:38:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:38:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-25 02:38:12,862 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2018-01-25 02:38:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:12,863 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-25 02:38:12,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:38:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-25 02:38:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:38:12,864 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:12,865 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:38:12,865 INFO L371 AbstractCegarLoop]: === Iteration 4 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1435415779, now seen corresponding path program 1 times [2018-01-25 02:38:12,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:12,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:12,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:12,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:12,868 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:12,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:38:12,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:38:12,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:38:12,929 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:38:12,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:38:12,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:38:12,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:38:12,931 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 4 states. [2018-01-25 02:38:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:13,013 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-01-25 02:38:13,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:38:13,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-25 02:38:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:13,014 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:38:13,014 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 02:38:13,015 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:38:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 02:38:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 02:38:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:38:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-25 02:38:13,020 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 19 [2018-01-25 02:38:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:13,020 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-25 02:38:13,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:38:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-25 02:38:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 02:38:13,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:13,021 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:38:13,021 INFO L371 AbstractCegarLoop]: === Iteration 5 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1918733159, now seen corresponding path program 1 times [2018-01-25 02:38:13,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:13,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:13,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:13,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:13,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:13,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:38:13,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:38:13,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:38:13,063 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:38:13,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:38:13,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:38:13,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:38:13,064 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-25 02:38:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:13,160 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-01-25 02:38:13,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:38:13,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-25 02:38:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:13,162 INFO L225 Difference]: With dead ends: 90 [2018-01-25 02:38:13,162 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 02:38:13,163 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-25 02:38:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 02:38:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-01-25 02:38:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:38:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 02:38:13,172 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-01-25 02:38:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:13,172 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 02:38:13,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:38:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 02:38:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:38:13,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:13,173 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-25 02:38:13,173 INFO L371 AbstractCegarLoop]: === Iteration 6 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1355765508, now seen corresponding path program 1 times [2018-01-25 02:38:13,174 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:13,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:13,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:13,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:13,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:13,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:38:13,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:38:13,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:38:13,340 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:38:13,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:38:13,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:38:13,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:38:13,341 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-01-25 02:38:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:13,680 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-25 02:38:13,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:38:13,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-25 02:38:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:13,682 INFO L225 Difference]: With dead ends: 68 [2018-01-25 02:38:13,682 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 02:38:13,682 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:38:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 02:38:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-25 02:38:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:38:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 02:38:13,690 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2018-01-25 02:38:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:13,690 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 02:38:13,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:38:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 02:38:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:38:13,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:13,692 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-25 02:38:13,692 INFO L371 AbstractCegarLoop]: === Iteration 7 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 461327576, now seen corresponding path program 1 times [2018-01-25 02:38:13,692 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:13,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:13,693 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:13,693 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:13,693 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:13,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:13,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-25 02:38:13,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:13,994 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:38:13,996 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 02:38:13,998 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [15], [19], [22], [23], [26], [32], [47], [51], [59], [64], [66], [67], [74], [75], [76], [78] [2018-01-25 02:38:14,073 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:38:14,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:38:16,961 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:38:16,963 INFO L268 AbstractInterpreter]: Visited 23 different actions 40 times. Merged at 12 different actions 17 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 02:38:16,983 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:38:16,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:16,984 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:38:16,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:16,995 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:17,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:17,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 02:38:17,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:17,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:38:17,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:38:17,622 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-25 02:38:17,623 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:18,021 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-25 02:38:18,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:18,050 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:38:18,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:18,055 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:18,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:18,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 02:38:18,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:18,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:38:18,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:38:18,151 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-25 02:38:18,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:18,280 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-25 02:38:18,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:38:18,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-25 02:38:18,282 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:38:18,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:38:18,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:38:18,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-01-25 02:38:18,284 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-01-25 02:38:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:18,557 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-25 02:38:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:38:18,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-01-25 02:38:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:18,558 INFO L225 Difference]: With dead ends: 58 [2018-01-25 02:38:18,558 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 02:38:18,558 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-01-25 02:38:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 02:38:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-01-25 02:38:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 02:38:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-25 02:38:18,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2018-01-25 02:38:18,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:18,568 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-25 02:38:18,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:38:18,568 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-25 02:38:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:38:18,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:18,569 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-25 02:38:18,569 INFO L371 AbstractCegarLoop]: === Iteration 8 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2040783234, now seen corresponding path program 1 times [2018-01-25 02:38:18,569 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:18,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:18,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:18,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:18,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:18,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:18,643 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-25 02:38:18,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:18,644 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:38:18,644 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 02:38:18,644 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [22], [23], [25], [26], [34], [35], [38], [41], [43], [59], [64], [66], [67], [74], [75], [76], [78] [2018-01-25 02:38:18,645 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:38:18,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:38:25,442 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:38:25,442 INFO L268 AbstractInterpreter]: Visited 25 different actions 45 times. Merged at 10 different actions 20 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 02:38:25,449 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:38:25,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:25,450 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-25 02:38:25,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:25,457 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:25,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:25,492 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-25 02:38:25,492 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:25,527 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-25 02:38:25,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:25,549 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-25 02:38:25,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:25,552 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:25,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:25,584 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-25 02:38:25,585 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:25,620 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-25 02:38:25,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:38:25,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 8 [2018-01-25 02:38:25,622 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:38:25,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:38:25,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:38:25,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:38:25,623 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2018-01-25 02:38:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:25,734 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-01-25 02:38:25,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:38:25,734 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-25 02:38:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:25,736 INFO L225 Difference]: With dead ends: 79 [2018-01-25 02:38:25,736 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 02:38:25,736 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-25 02:38:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 02:38:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-01-25 02:38:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:38:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-25 02:38:25,747 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-01-25 02:38:25,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:25,747 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-25 02:38:25,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:38:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-25 02:38:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:38:25,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:25,748 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-25 02:38:25,748 INFO L371 AbstractCegarLoop]: === Iteration 9 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1160223154, now seen corresponding path program 1 times [2018-01-25 02:38:25,749 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:25,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:25,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:25,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:25,750 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:25,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:25,914 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-25 02:38:25,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:25,915 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:38:25,915 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 02:38:25,915 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [22], [23], [26], [28], [32], [34], [35], [38], [41], [43], [49], [59], [64], [66], [67], [74], [75], [76], [78] [2018-01-25 02:38:25,917 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:38:25,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:38:30,440 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:38:30,440 INFO L268 AbstractInterpreter]: Visited 27 different actions 59 times. Merged at 12 different actions 29 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-01-25 02:38:30,452 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:38:30,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:30,452 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-25 02:38:30,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:30,465 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:30,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:30,696 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 23 [2018-01-25 02:38:30,882 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-25 02:38:30,882 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:31,137 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-25 02:38:31,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:31,151 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-25 02:38:31,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:31,161 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-25 02:38:31,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:31 [2018-01-25 02:38:31,228 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-25 02:38:31,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:31,253 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-25 02:38:31,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:31,256 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:31,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:31,487 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-25 02:38:31,487 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:31,592 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 30 treesize of output 26 [2018-01-25 02:38:31,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:31,605 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-25 02:38:31,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:31,612 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-25 02:38:31,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:30 [2018-01-25 02:38:31,673 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-25 02:38:31,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:38:31,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 10, 10] total 38 [2018-01-25 02:38:31,675 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:38:31,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 02:38:31,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 02:38:31,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 02:38:31,676 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 21 states. [2018-01-25 02:38:32,257 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 36 DAG size of output 24 [2018-01-25 02:38:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:32,643 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-01-25 02:38:32,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 02:38:32,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-25 02:38:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:32,644 INFO L225 Difference]: With dead ends: 89 [2018-01-25 02:38:32,645 INFO L226 Difference]: Without dead ends: 69 [2018-01-25 02:38:32,646 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-25 02:38:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-25 02:38:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-01-25 02:38:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:38:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-25 02:38:32,657 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 28 [2018-01-25 02:38:32,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:32,658 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-25 02:38:32,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 02:38:32,658 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-25 02:38:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 02:38:32,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:38:32,659 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-25 02:38:32,659 INFO L371 AbstractCegarLoop]: === Iteration 10 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:38:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2127039869, now seen corresponding path program 1 times [2018-01-25 02:38:32,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:38:32,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:32,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:32,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:38:32,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:38:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:32,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:38:32,863 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-25 02:38:32,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:32,864 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:38:32,864 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 02:38:32,864 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [15], [19], [22], [23], [25], [26], [32], [47], [51], [59], [64], [66], [67], [74], [75], [76], [78] [2018-01-25 02:38:32,865 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:38:32,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:38:34,068 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:38:34,068 INFO L268 AbstractInterpreter]: Visited 23 different actions 39 times. Merged at 12 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-01-25 02:38:34,076 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:38:34,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:34,076 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-25 02:38:34,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:34,087 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:34,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:34,176 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-25 02:38:34,176 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:34,204 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 02:38:34,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:34,209 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-25 02:38:34,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:34,211 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-25 02:38:34,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:7 [2018-01-25 02:38:34,314 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-25 02:38:34,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:38:34,335 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-25 02:38:34,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:38:34,342 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:38:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:38:34,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:38:34,495 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-25 02:38:34,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:38:34,498 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 02:38:34,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:34,502 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-25 02:38:34,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:38:34,503 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-25 02:38:34,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:7 [2018-01-25 02:38:34,551 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-25 02:38:34,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:38:34,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 8, 8] total 28 [2018-01-25 02:38:34,553 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:38:34,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 02:38:34,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 02:38:34,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2018-01-25 02:38:34,555 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 18 states. [2018-01-25 02:38:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:38:35,355 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-25 02:38:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 02:38:35,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-25 02:38:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:38:35,356 INFO L225 Difference]: With dead ends: 75 [2018-01-25 02:38:35,356 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 02:38:35,357 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2018-01-25 02:38:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 02:38:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 02:38:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 02:38:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 02:38:35,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-25 02:38:35,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:38:35,358 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 02:38:35,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 02:38:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 02:38:35,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 02:38:35,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 02:38:35,384 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 02:38:35,494 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-01-25 02:38:35,729 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 32 DAG size of output 1 [2018-01-25 02:38:35,860 WARN L143 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-25 02:38:36,374 WARN L146 SmtUtils]: Spent 513ms on a formula simplification. DAG size of input: 88 DAG size of output 55 [2018-01-25 02:38:37,141 WARN L146 SmtUtils]: Spent 765ms on a formula simplification. DAG size of input: 84 DAG size of output 55 [2018-01-25 02:38:37,145 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,145 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:38:37,145 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point L546''''''(lines 546 547) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point insertionSortErr8RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point insertionSortErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 02:38:37,146 INFO L401 ceAbstractionStarter]: For program point insertionSortErr9RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,147 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-25 02:38:37,147 INFO L401 ceAbstractionStarter]: For program point L543'''(lines 543 549) no Hoare annotation was computed. [2018-01-25 02:38:37,147 INFO L397 ceAbstractionStarter]: At program point L546'''''''(lines 546 547) the Hoare annotation is: (let ((.cse10 (* 4 insertionSort_~i~2))) (let ((.cse9 (select |#length| insertionSort_~a.base)) (.cse3 (<= 4 (+ insertionSort_~a.offset .cse10))) (.cse7 (select |#valid| |insertionSort_#in~a.base|)) (.cse0 (= 1 (select |#valid| insertionSort_~a.base))) (.cse1 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_2)))) (.cse8 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |insertionSort_#in~a.base|)))))) (let ((.cse5 (<= 0 insertionSort_~j~2)) (.cse6 (and .cse3 (= 1 .cse7) .cse0 .cse1 .cse8)) (.cse4 (<= (+ insertionSort_~a.offset .cse10 4) .cse9)) (.cse2 (= insertionSort_~a.offset 0))) (or (and .cse0 (= insertionSort_~j~2 1) .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= insertionSort_~j~2 0) .cse6 .cse4 .cse2) (not (= .cse7 1)) (not .cse8) (and .cse5 (<= 2 insertionSort_~i~2) .cse6 .cse4 .cse2 (<= (+ (* 4 insertionSort_~j~2) 4) .cse9)) (< (select |#length| |insertionSort_#in~a.base|) 4) (not (= 0 |insertionSort_#in~a.offset|)))))) [2018-01-25 02:38:37,147 INFO L401 ceAbstractionStarter]: For program point insertionSortErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,147 INFO L397 ceAbstractionStarter]: At program point L543''(lines 543 549) the Hoare annotation is: (let ((.cse0 (select |#length| insertionSort_~a.base)) (.cse4 (= 1 (select |#valid| insertionSort_~a.base))) (.cse5 (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| insertionSort_~a.base)) (<= insertionSort_~array_size v_main_~array_size~5_BEFORE_CALL_2)))) (.cse3 (= 0 insertionSort_~a.offset))) (or (and (<= (+ insertionSort_~a.offset (* 4 insertionSort_~i~2)) .cse0) (let ((.cse1 (<= 1 insertionSort_~i~2)) (.cse2 (and .cse3 .cse4 .cse5))) (or (and (<= 0 insertionSort_~j~2) (<= insertionSort_~j~2 0) .cse1 .cse2) (and .cse1 .cse2 (< 0 insertionSort_~j~2) (<= (+ (* 4 insertionSort_~j~2) 4) .cse0))))) (and (<= 4 .cse0) .cse4 .cse5 .cse3 (= 1 insertionSort_~i~2)) (not (= (select |#valid| |insertionSort_#in~a.base|) 1)) (not (exists ((v_main_~array_size~5_BEFORE_CALL_2 Int)) (and (<= |insertionSort_#in~array_size| v_main_~array_size~5_BEFORE_CALL_2) (= (* 4 v_main_~array_size~5_BEFORE_CALL_2) (select |#length| |insertionSort_#in~a.base|))))) (< (select |#length| |insertionSort_#in~a.base|) 4) (not (= 0 |insertionSort_#in~a.offset|)))) [2018-01-25 02:38:37,147 INFO L401 ceAbstractionStarter]: For program point insertionSortEXIT(lines 540 550) no Hoare annotation was computed. [2018-01-25 02:38:37,147 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point insertionSortErr7RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point L546''''''''(lines 546 547) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point insertionSortErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point insertionSortErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point insertionSortErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L404 ceAbstractionStarter]: At program point insertionSortENTRY(lines 540 550) the Hoare annotation is: true [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point insertionSortErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point insertionSortErr6RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,148 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-25 02:38:37,149 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 02:38:37,149 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-25 02:38:37,149 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,149 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-25 02:38:37,149 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:38:37,149 INFO L401 ceAbstractionStarter]: For program point L553(lines 553 555) no Hoare annotation was computed. [2018-01-25 02:38:37,149 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-25 02:38:37,149 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 551 559) no Hoare annotation was computed. [2018-01-25 02:38:37,149 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-25 02:38:37,150 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 551 559) no Hoare annotation was computed. [2018-01-25 02:38:37,150 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 551 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:38:37,150 INFO L401 ceAbstractionStarter]: For program point L553''(lines 553 555) no Hoare annotation was computed. [2018-01-25 02:38:37,150 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-25 02:38:37,150 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-25 02:38:37,150 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-25 02:38:37,150 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 551 559) no Hoare annotation was computed. [2018-01-25 02:38:37,162 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,164 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,165 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,166 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,166 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,166 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,167 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,167 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,167 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,168 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,168 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,170 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,171 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,172 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,173 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,180 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,181 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,182 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,183 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,183 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,184 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,185 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,190 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,191 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,192 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,192 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,194 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,196 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,197 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,198 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:38:37 BoogieIcfgContainer [2018-01-25 02:38:37,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:38:37,203 INFO L168 Benchmark]: Toolchain (without parser) took 26565.04 ms. Allocated memory was 297.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 256.2 MB in the beginning and 912.6 MB in the end (delta: -656.4 MB). Peak memory consumption was 354.4 MB. Max. memory is 5.3 GB. [2018-01-25 02:38:37,204 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 297.3 MB. Free memory is still 262.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:38:37,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.92 ms. Allocated memory is still 297.3 MB. Free memory was 256.2 MB in the beginning and 246.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:38:37,204 INFO L168 Benchmark]: Boogie Preprocessor took 32.21 ms. Allocated memory is still 297.3 MB. Free memory was 246.1 MB in the beginning and 244.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:38:37,205 INFO L168 Benchmark]: RCFGBuilder took 275.49 ms. Allocated memory is still 297.3 MB. Free memory was 244.1 MB in the beginning and 227.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-25 02:38:37,205 INFO L168 Benchmark]: TraceAbstraction took 26041.08 ms. Allocated memory was 297.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 227.2 MB in the beginning and 912.6 MB in the end (delta: -685.4 MB). Peak memory consumption was 325.4 MB. Max. memory is 5.3 GB. [2018-01-25 02:38:37,207 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 297.3 MB. Free memory is still 262.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.92 ms. Allocated memory is still 297.3 MB. Free memory was 256.2 MB in the beginning and 246.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.21 ms. Allocated memory is still 297.3 MB. Free memory was 246.1 MB in the beginning and 244.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.49 ms. Allocated memory is still 297.3 MB. Free memory was 244.1 MB in the beginning and 227.2 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 26041.08 ms. Allocated memory was 297.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 227.2 MB in the beginning and 912.6 MB in the end (delta: -685.4 MB). Peak memory consumption was 325.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 187 LocStat_NO_SUPPORTING_DISEQUALITIES : 17 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 52 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.283455 RENAME_VARIABLES(MILLISECONDS) : 1.986710 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.200147 PROJECTAWAY(MILLISECONDS) : 46.986434 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.118344 DISJOIN(MILLISECONDS) : 0.857982 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 2.045604 ADD_EQUALITY(MILLISECONDS) : 0.065742 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.045332 #CONJOIN_DISJUNCTIVE : 77 #RENAME_VARIABLES : 136 #UNFREEZE : 0 #CONJOIN : 117 #PROJECTAWAY : 103 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 125 #ADD_EQUALITY : 53 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 219 LocStat_NO_SUPPORTING_DISEQUALITIES : 19 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 54 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.586431 RENAME_VARIABLES(MILLISECONDS) : 1.783491 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.496925 PROJECTAWAY(MILLISECONDS) : 33.394068 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.132303 DISJOIN(MILLISECONDS) : 0.850153 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.844688 ADD_EQUALITY(MILLISECONDS) : 0.070900 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019179 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 154 #UNFREEZE : 0 #CONJOIN : 131 #PROJECTAWAY : 116 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 20 #RENAME_VARIABLES_DISJUNCTIVE : 139 #ADD_EQUALITY : 55 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 230 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.193106 RENAME_VARIABLES(MILLISECONDS) : 0.788269 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.151651 PROJECTAWAY(MILLISECONDS) : 28.559820 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.048517 DISJOIN(MILLISECONDS) : 0.351259 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.809384 ADD_EQUALITY(MILLISECONDS) : 0.027582 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011206 #CONJOIN_DISJUNCTIVE : 108 #RENAME_VARIABLES : 203 #UNFREEZE : 0 #CONJOIN : 157 #PROJECTAWAY : 139 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 25 #RENAME_VARIABLES_DISJUNCTIVE : 185 #ADD_EQUALITY : 57 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 192 LocStat_NO_SUPPORTING_DISEQUALITIES : 17 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 52 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.981313 RENAME_VARIABLES(MILLISECONDS) : 0.688662 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.949389 PROJECTAWAY(MILLISECONDS) : 19.490505 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.058123 DISJOIN(MILLISECONDS) : 0.455311 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.709320 ADD_EQUALITY(MILLISECONDS) : 0.020991 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007323 #CONJOIN_DISJUNCTIVE : 75 #RENAME_VARIABLES : 130 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 99 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 53 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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-25 02:38:37,221 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,222 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,223 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,238 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,238 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,239 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,239 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,240 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,241 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,252 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,253 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,254 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((1 == \valid[a] && j == 1) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && a == 0) && 4 <= a + 4 * i) && a + 4 * i + 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_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a])) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && a == 0)) || !(\valid[a] == 1)) || !(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a])) || (((((0 <= j && 2 <= i) && (((4 <= a + 4 * i && 1 == \valid[a]) && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a])) && a + 4 * i + 4 <= unknown-#length-unknown[a]) && a == 0) && 4 * j + 4 <= unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4) || !(0 == a) - InvariantResult [Line: 543]: Loop Invariant [2018-01-25 02:38:37,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,268 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,271 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,272 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-25 02:38:37,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,273 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:38:37,274 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((a + 4 * i <= unknown-#length-unknown[a] && ((((0 <= j && j <= 0) && 1 <= i) && (0 == a && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) || (((1 <= i && (0 == a && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && 0 < j) && 4 * j + 4 <= unknown-#length-unknown[a]))) || ((((4 <= unknown-#length-unknown[a] && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a] && array_size <= v_main_~array_size~5_BEFORE_CALL_2)) && 0 == a) && 1 == i)) || !(\valid[a] == 1)) || !(\exists v_main_~array_size~5_BEFORE_CALL_2 : int :: \old(array_size) <= v_main_~array_size~5_BEFORE_CALL_2 && 4 * v_main_~array_size~5_BEFORE_CALL_2 == unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4) || !(0 == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 11 error locations. SAFE Result, 25.8s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 252 SDtfs, 1128 SDslu, 957 SDs, 0 SdLazy, 1185 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 365 SyntacticMatches, 18 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 4.8s 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, 15.5s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 142 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 17 NumberOfFragments, 391 HoareAnnotationTreeSize, 8 FomulaSimplifications, 9618 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2115 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s 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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_02-38-37-280.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-38-37-280.csv Received shutdown request...