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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:49:32,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:49:32,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:49:32,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:49:32,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:49:32,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:49:32,954 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:49:32,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:49:32,957 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:49:32,958 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:49:32,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:49:32,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:49:32,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:49:32,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:49:32,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:49:32,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:49:32,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:49:32,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:49:32,969 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:49:32,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:49:32,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:49:32,973 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:49:32,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:49:32,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:49:32,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:49:32,976 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:49:32,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:49:32,977 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:49:32,977 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:49:32,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:49:32,978 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:49:32,978 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_mostprecise.epf [2018-01-24 19:49:32,988 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:49:32,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:49:32,989 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:49:32,989 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:49:32,989 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:49:32,990 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:49:32,990 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:49:32,990 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:49:32,990 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:49:32,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:49:32,991 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:49:32,991 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:49:32,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:49:32,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:49:32,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:49:32,992 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:49:32,992 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:49:32,992 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:49:32,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:49:32,993 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:49:32,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:49:32,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:49:32,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:49:32,993 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:49:32,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:49:32,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:49:32,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:49:32,994 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:49:32,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:49:32,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:49:32,995 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:49:32,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:49:32,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:49:32,995 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:49:32,995 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:49:32,996 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:49:32,997 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:49:33,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:49:33,043 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:49:33,047 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:49:33,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:49:33,050 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:49:33,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:49:33,224 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:49:33,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:49:33,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:49:33,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:49:33,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:49:33,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33, skipping insertion in model container [2018-01-24 19:49:33,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,251 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:49:33,287 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:49:33,402 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:49:33,419 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:49:33,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33 WrapperNode [2018-01-24 19:49:33,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:49:33,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:49:33,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:49:33,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:49:33,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... [2018-01-24 19:49:33,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:49:33,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:49:33,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:49:33,464 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:49:33,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:49:33,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:49:33,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:49:33,510 INFO L136 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-01-24 19:49:33,510 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:49:33,510 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:49:33,510 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:49:33,510 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:49:33,510 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:49:33,510 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:49:33,511 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:49:33,511 INFO L128 BoogieDeclarations]: Found specification of procedure insertionSort [2018-01-24 19:49:33,511 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:49:33,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:49:33,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:49:33,703 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:49:33,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:49:33 BoogieIcfgContainer [2018-01-24 19:49:33,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:49:33,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:49:33,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:49:33,706 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:49:33,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:49:33" (1/3) ... [2018-01-24 19:49:33,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2106176a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:49:33, skipping insertion in model container [2018-01-24 19:49:33,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:49:33" (2/3) ... [2018-01-24 19:49:33,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2106176a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:49:33, skipping insertion in model container [2018-01-24 19:49:33,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:49:33" (3/3) ... [2018-01-24 19:49:33,709 INFO L105 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:49:33,715 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:49:33,720 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 19:49:33,766 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:49:33,766 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:49:33,766 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:49:33,767 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:49:33,767 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:49:33,767 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:49:33,767 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:49:33,767 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:49:33,768 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:49:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 19:49:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:49:33,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:33,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:33,795 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 243546787, now seen corresponding path program 1 times [2018-01-24 19:49:33,801 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:33,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:33,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:33,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:33,841 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:33,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:34,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:49:34,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:49:34,006 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:49:34,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:49:34,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:49:34,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:49:34,026 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2018-01-24 19:49:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:34,250 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-01-24 19:49:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:49:34,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-24 19:49:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:34,303 INFO L225 Difference]: With dead ends: 76 [2018-01-24 19:49:34,303 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 19:49:34,307 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:49:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 19:49:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 19:49:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 19:49:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 19:49:34,346 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-24 19:49:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:34,347 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 19:49:34,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:49:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 19:49:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:49:34,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:34,347 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:34,347 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:34,348 INFO L82 PathProgramCache]: Analyzing trace with hash 243546788, now seen corresponding path program 1 times [2018-01-24 19:49:34,348 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:34,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:34,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:34,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:34,349 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:34,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:34,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:49:34,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:49:34,554 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:49:34,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 19:49:34,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 19:49:34,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:49:34,556 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-01-24 19:49:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:34,765 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-01-24 19:49:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:49:34,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 19:49:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:34,769 INFO L225 Difference]: With dead ends: 60 [2018-01-24 19:49:34,769 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 19:49:34,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 19:49:34,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 19:49:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-01-24 19:49:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 19:49:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 19:49:34,779 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-01-24 19:49:34,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:34,779 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 19:49:34,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 19:49:34,780 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 19:49:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:49:34,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:34,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:34,781 INFO L371 AbstractCegarLoop]: === Iteration 3 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:34,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1724462409, now seen corresponding path program 1 times [2018-01-24 19:49:34,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:34,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:34,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:34,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:34,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:34,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:34,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:49:34,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:49:34,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:49:34,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:49:34,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:49:34,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:49:34,873 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-01-24 19:49:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:35,070 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-01-24 19:49:35,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:49:35,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 19:49:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:35,071 INFO L225 Difference]: With dead ends: 81 [2018-01-24 19:49:35,071 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 19:49:35,072 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 19:49:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 19:49:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2018-01-24 19:49:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 19:49:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 19:49:35,079 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2018-01-24 19:49:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:35,080 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 19:49:35,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:49:35,080 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 19:49:35,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:49:35,080 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:35,081 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:35,081 INFO L371 AbstractCegarLoop]: === Iteration 4 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1435415779, now seen corresponding path program 1 times [2018-01-24 19:49:35,081 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:35,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:35,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:35,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:35,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:49:35,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:49:35,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:49:35,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:49:35,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:49:35,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:49:35,143 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 4 states. [2018-01-24 19:49:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:35,225 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-01-24 19:49:35,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:49:35,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 19:49:35,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:35,227 INFO L225 Difference]: With dead ends: 48 [2018-01-24 19:49:35,227 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 19:49:35,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:49:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 19:49:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 19:49:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 19:49:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-24 19:49:35,233 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 19 [2018-01-24 19:49:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:35,233 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-24 19:49:35,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:49:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-24 19:49:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 19:49:35,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:35,234 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:35,234 INFO L371 AbstractCegarLoop]: === Iteration 5 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1918733159, now seen corresponding path program 1 times [2018-01-24 19:49:35,234 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:35,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:35,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:35,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:35,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:49:35,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:49:35,273 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:49:35,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:49:35,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:49:35,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:49:35,274 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-24 19:49:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:35,386 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-01-24 19:49:35,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:49:35,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-24 19:49:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:35,388 INFO L225 Difference]: With dead ends: 90 [2018-01-24 19:49:35,388 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 19:49:35,389 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:49:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 19:49:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-01-24 19:49:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 19:49:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 19:49:35,394 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-01-24 19:49:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:35,395 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 19:49:35,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:49:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 19:49:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 19:49:35,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:35,395 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:35,395 INFO L371 AbstractCegarLoop]: === Iteration 6 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1355765508, now seen corresponding path program 1 times [2018-01-24 19:49:35,396 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:35,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:35,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,397 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:35,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:35,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:49:35,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:49:35,500 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:49:35,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:49:35,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:49:35,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:49:35,501 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-01-24 19:49:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:35,672 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-01-24 19:49:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:49:35,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 19:49:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:35,674 INFO L225 Difference]: With dead ends: 68 [2018-01-24 19:49:35,674 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 19:49:35,674 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 19:49:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 19:49:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-24 19:49:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 19:49:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 19:49:35,679 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2018-01-24 19:49:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:35,680 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 19:49:35,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:49:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 19:49:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 19:49:35,680 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:35,680 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:35,681 INFO L371 AbstractCegarLoop]: === Iteration 7 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash 461327576, now seen corresponding path program 1 times [2018-01-24 19:49:35,681 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:35,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,682 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:35,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:35,682 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:35,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:35,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:35,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:35,814 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:49:35,815 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 19:49:35,816 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-24 19:49:35,865 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:49:35,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:49:37,790 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:49:37,791 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-24 19:49:37,812 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:49:37,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:37,812 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:49:37,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:37,823 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:37,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:37,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:49:37,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:37,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:37,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:49:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:38,211 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:38,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:38,481 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:49:38,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:38,485 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:38,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:38,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:49:38,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:38,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:38,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 19:49:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:38,558 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:38,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:49:38,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-24 19:49:38,643 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:49:38,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 19:49:38,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 19:49:38,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-01-24 19:49:38,644 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states. [2018-01-24 19:49:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:39,017 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-01-24 19:49:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:49:39,017 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-01-24 19:49:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:39,018 INFO L225 Difference]: With dead ends: 58 [2018-01-24 19:49:39,018 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 19:49:39,019 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 85 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2018-01-24 19:49:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 19:49:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2018-01-24 19:49:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 19:49:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 19:49:39,028 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2018-01-24 19:49:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:39,029 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 19:49:39,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 19:49:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 19:49:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 19:49:39,030 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:39,030 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:39,030 INFO L371 AbstractCegarLoop]: === Iteration 8 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2040783234, now seen corresponding path program 1 times [2018-01-24 19:49:39,030 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:39,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:39,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:39,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:39,032 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:39,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:39,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:39,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:39,113 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:49:39,113 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 19:49:39,113 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-24 19:49:39,115 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:49:39,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:49:44,665 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:49:44,665 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-24 19:49:44,668 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:49:44,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:44,668 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:49:44,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:44,675 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:44,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:44,733 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:44,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:44,784 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:49:44,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:44,787 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:44,814 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:44,817 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:44,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:44,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:49:44,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 8 [2018-01-24 19:49:44,849 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:49:44,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:49:44,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:49:44,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:49:44,849 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 8 states. [2018-01-24 19:49:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:44,952 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-01-24 19:49:44,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:49:44,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-24 19:49:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:44,954 INFO L225 Difference]: With dead ends: 79 [2018-01-24 19:49:44,954 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 19:49:44,954 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:49:44,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 19:49:44,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-01-24 19:49:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 19:49:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 19:49:44,962 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-01-24 19:49:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:44,962 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 19:49:44,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:49:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 19:49:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:49:44,964 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:44,964 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:44,964 INFO L371 AbstractCegarLoop]: === Iteration 9 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:44,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1160223154, now seen corresponding path program 1 times [2018-01-24 19:49:44,964 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:44,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:44,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:44,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:44,965 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:44,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:44,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:45,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:45,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:45,197 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:49:45,197 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 19:49:45,198 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-24 19:49:45,199 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:49:45,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:49:49,495 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:49:49,496 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-24 19:49:49,536 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:49:49,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:49,536 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:49:49,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:49,542 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:49,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:49,836 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:50,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 19:49:50,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:50,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-24 19:49:50,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:50,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:49:50,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:31 [2018-01-24 19:49:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:50,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:50,230 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:49:50,234 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:50,235 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:50,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:50,474 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:50,575 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-24 19:49:50,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:50,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-24 19:49:50,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:50,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 19:49:50,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:30 [2018-01-24 19:49:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:50,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:49:50,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 10, 10] total 38 [2018-01-24 19:49:50,666 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:49:50,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 19:49:50,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 19:49:50,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 19:49:50,667 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 21 states. [2018-01-24 19:49:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:51,450 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-01-24 19:49:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 19:49:51,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2018-01-24 19:49:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:51,451 INFO L225 Difference]: With dead ends: 89 [2018-01-24 19:49:51,451 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 19:49:51,452 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=578, Invalid=2392, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 19:49:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 19:49:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2018-01-24 19:49:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 19:49:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 19:49:51,461 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 28 [2018-01-24 19:49:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:51,461 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 19:49:51,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 19:49:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 19:49:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 19:49:51,462 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:49:51,462 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:49:51,462 INFO L371 AbstractCegarLoop]: === Iteration 10 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 19:49:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2127039869, now seen corresponding path program 1 times [2018-01-24 19:49:51,462 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:49:51,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:51,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:51,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:49:51,463 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:49:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:51,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:49:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:51,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:51,576 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:49:51,576 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 19:49:51,577 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-24 19:49:51,578 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:49:51,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:49:52,848 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:49:52,849 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-24 19:49:52,850 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:49:52,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:52,850 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 19:49:52,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:52,855 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:52,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:52,934 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:52,964 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 19:49:52,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:52,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-01-24 19:49:52,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:52,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:52,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:7 [2018-01-24 19:49:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:53,079 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:53,079 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 19:49:53,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:53,083 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:53,109 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:53,184 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:53,186 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 19:49:53,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:53,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-01-24 19:49:53,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:53,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:53,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:7 [2018-01-24 19:49:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:49:53,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 19:49:53,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8, 8, 8] total 28 [2018-01-24 19:49:53,232 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 19:49:53,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 19:49:53,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 19:49:53,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2018-01-24 19:49:53,233 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 18 states. [2018-01-24 19:49:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:49:53,587 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-24 19:49:53,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 19:49:53,587 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-24 19:49:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:49:53,587 INFO L225 Difference]: With dead ends: 75 [2018-01-24 19:49:53,587 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 19:49:53,588 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 19:49:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 19:49:53,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 19:49:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 19:49:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 19:49:53,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-01-24 19:49:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:49:53,589 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 19:49:53,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 19:49:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 19:49:53,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 19:49:53,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 19:49:53,613 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 19:49:54,100 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 88 DAG size of output 55 [2018-01-24 19:49:54,573 WARN L146 SmtUtils]: Spent 471ms on a formula simplification. DAG size of input: 84 DAG size of output 55 [2018-01-24 19:49:54,577 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point L546''''''(lines 546 547) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point insertionSortErr8RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-24 19:49:54,609 INFO L401 ceAbstractionStarter]: For program point insertionSortErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point insertionSortErr9RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point L546''''(line 546) no Hoare annotation was computed. [2018-01-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point L543'''(lines 543 549) no Hoare annotation was computed. [2018-01-24 19:49:54,610 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-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point insertionSortErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,610 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-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point insertionSortEXIT(lines 540 550) no Hoare annotation was computed. [2018-01-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point insertionSortErr7RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,610 INFO L401 ceAbstractionStarter]: For program point L546''''''''(lines 546 547) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point L547''(line 547) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point insertionSortErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point insertionSortErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point insertionSortErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L404 ceAbstractionStarter]: At program point insertionSortENTRY(lines 540 550) the Hoare annotation is: true [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point insertionSortErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point insertionSortErr6RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-24 19:49:54,611 INFO L401 ceAbstractionStarter]: For program point L553(lines 553 555) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L397 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= 0 |main_#t~malloc9.offset|) (= 1 (select |#valid| main_~a~5.base)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= .cse0 (select |#length| main_~a~5.base)) (= 0 main_~a~5.offset) (<= 1 main_~array_size~5) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= .cse0 (select |#length| |main_#t~malloc9.base|)))) [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 551 559) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 551 559) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 551 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point L553''(lines 553 555) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-24 19:49:54,612 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 551 559) no Hoare annotation was computed. [2018-01-24 19:49:54,619 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,620 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,621 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,622 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,624 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,625 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,631 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,632 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,633 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,634 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,634 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,636 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,639 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,640 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,641 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,643 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,645 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,645 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,646 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,646 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,646 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,647 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,647 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,647 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:49:54 BoogieIcfgContainer [2018-01-24 19:49:54,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:49:54,652 INFO L168 Benchmark]: Toolchain (without parser) took 21427.57 ms. Allocated memory was 306.2 MB in the beginning and 1.3 GB in the end (delta: 945.3 MB). Free memory was 264.5 MB in the beginning and 792.3 MB in the end (delta: -527.8 MB). Peak memory consumption was 417.5 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:54,653 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:49:54,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.51 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:54,654 INFO L168 Benchmark]: Boogie Preprocessor took 34.76 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:54,654 INFO L168 Benchmark]: RCFGBuilder took 239.85 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 234.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:54,654 INFO L168 Benchmark]: TraceAbstraction took 20947.08 ms. Allocated memory was 306.2 MB in the beginning and 1.3 GB in the end (delta: 945.3 MB). Free memory was 234.6 MB in the beginning and 792.3 MB in the end (delta: -557.7 MB). Peak memory consumption was 387.6 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:54,656 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.22 ms. Allocated memory is still 306.2 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.51 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 253.4 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.76 ms. Allocated memory is still 306.2 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 239.85 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 234.6 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20947.08 ms. Allocated memory was 306.2 MB in the beginning and 1.3 GB in the end (delta: 945.3 MB). Free memory was 234.6 MB in the beginning and 792.3 MB in the end (delta: -557.7 MB). Peak memory consumption was 387.6 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) : 1.820985 RENAME_VARIABLES(MILLISECONDS) : 1.164199 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.775985 PROJECTAWAY(MILLISECONDS) : 40.915674 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.081022 DISJOIN(MILLISECONDS) : 0.753640 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.193405 ADD_EQUALITY(MILLISECONDS) : 0.058415 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.044082 #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) : 1.758834 RENAME_VARIABLES(MILLISECONDS) : 0.885580 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.706751 PROJECTAWAY(MILLISECONDS) : 22.602289 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.079981 DISJOIN(MILLISECONDS) : 0.509090 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.906914 ADD_EQUALITY(MILLISECONDS) : 0.038510 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009971 #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.240612 RENAME_VARIABLES(MILLISECONDS) : 0.782795 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.203457 PROJECTAWAY(MILLISECONDS) : 33.016134 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.053943 DISJOIN(MILLISECONDS) : 0.329141 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.802273 ADD_EQUALITY(MILLISECONDS) : 0.055960 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009329 #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) : 1.020145 RENAME_VARIABLES(MILLISECONDS) : 0.680701 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.986925 PROJECTAWAY(MILLISECONDS) : 18.734165 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.044720 DISJOIN(MILLISECONDS) : 0.265248 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.701899 ADD_EQUALITY(MILLISECONDS) : 0.036316 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006655 #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-24 19:49:54,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,669 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,670 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,671 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,672 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,672 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,673 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,674 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,677 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,678 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,679 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,680 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,681 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,682 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,682 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-24 19:49:54,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,685 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,685 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,685 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,688 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,689 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,690 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_2,QUANTIFIED] [2018-01-24 19:49:54,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 19:49:54,691 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, 20.8s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 252 SDtfs, 1128 SDslu, 957 SDs, 0 SdLazy, 1185 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 365 SyntacticMatches, 18 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 3.4s 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, 13.1s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 142 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 17 NumberOfFragments, 391 HoareAnnotationTreeSize, 8 FomulaSimplifications, 9618 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 2115 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_19-49-54-697.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-49-54-697.csv Received shutdown request...