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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:49:03,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:49:03,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:49:03,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:49:03,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:49:03,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:49:03,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:49:03,371 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:49:03,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:49:03,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:49:03,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:49:03,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:49:03,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:49:03,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:49:03,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:49:03,381 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:49:03,383 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:49:03,385 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:49:03,386 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:49:03,387 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:49:03,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:49:03,390 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:49:03,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:49:03,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:49:03,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:49:03,393 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:49:03,393 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:49:03,394 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:49:03,394 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:49:03,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:49:03,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:49:03,395 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:49:03,403 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:49:03,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:49:03,404 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:49:03,404 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:49:03,404 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:49:03,404 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:49:03,405 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:49:03,405 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:49:03,405 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:49:03,405 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:49:03,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:49:03,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:49:03,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:49:03,406 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:49:03,406 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:49:03,406 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:49:03,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:49:03,406 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:49:03,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:49:03,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:49:03,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:49:03,407 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:49:03,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:49:03,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:49:03,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:49:03,408 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:49:03,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:49:03,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:49:03,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:49:03,408 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:49:03,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:49:03,408 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:49:03,409 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:49:03,409 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:49:03,441 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:49:03,452 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:49:03,456 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:49:03,457 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:49:03,457 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:49:03,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:49:03,604 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:49:03,609 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:49:03,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:49:03,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:49:03,615 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:49:03,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,618 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 11:49:03, skipping insertion in model container [2018-01-24 11:49:03,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,631 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:49:03,667 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:49:03,783 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:49:03,801 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:49:03,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03 WrapperNode [2018-01-24 11:49:03,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:49:03,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:49:03,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:49:03,810 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:49:03,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (1/1) ... [2018-01-24 11:49:03,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:49:03,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:49:03,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:49:03,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:49:03,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (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 11:49:03,890 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:49:03,891 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:49:03,891 INFO L136 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-01-24 11:49:03,891 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:49:03,891 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:49:03,891 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:49:03,891 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:49:03,891 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:49:03,892 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:49:03,892 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:49:03,892 INFO L128 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-01-24 11:49:03,892 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:49:03,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:49:03,892 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:49:04,131 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:49:04,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:49:04 BoogieIcfgContainer [2018-01-24 11:49:04,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:49:04,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:49:04,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:49:04,134 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:49:04,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:49:03" (1/3) ... [2018-01-24 11:49:04,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:49:04, skipping insertion in model container [2018-01-24 11:49:04,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:49:03" (2/3) ... [2018-01-24 11:49:04,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:49:04, skipping insertion in model container [2018-01-24 11:49:04,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:49:04" (3/3) ... [2018-01-24 11:49:04,136 INFO L105 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:49:04,142 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:49:04,148 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 11:49:04,191 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:49:04,192 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:49:04,192 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:49:04,192 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:49:04,192 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:49:04,192 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:49:04,193 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:49:04,193 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:49:04,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:49:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-24 11:49:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:49:04,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:04,220 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:04,220 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash -545325107, now seen corresponding path program 1 times [2018-01-24 11:49:04,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:04,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:04,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:04,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:04,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:04,387 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 11:49:04,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:04,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:49:04,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 11:49:04,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 11:49:04,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 11:49:04,406 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-01-24 11:49:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:04,423 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-01-24 11:49:04,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 11:49:04,424 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-24 11:49:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:04,432 INFO L225 Difference]: With dead ends: 85 [2018-01-24 11:49:04,433 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:49:04,436 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 11:49:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:49:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 11:49:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 11:49:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-24 11:49:04,544 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-01-24 11:49:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:04,544 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-24 11:49:04,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 11:49:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-24 11:49:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:49:04,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:04,545 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:04,545 INFO L371 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:04,545 INFO L82 PathProgramCache]: Analyzing trace with hash 274771065, now seen corresponding path program 1 times [2018-01-24 11:49:04,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:04,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:04,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:04,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:04,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:04,665 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 11:49:04,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:04,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:49:04,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:49:04,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:49:04,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:49:04,668 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-01-24 11:49:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:04,834 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 11:49:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:49:04,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 11:49:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:04,836 INFO L225 Difference]: With dead ends: 45 [2018-01-24 11:49:04,836 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 11:49:04,836 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 11:49:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 11:49:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 11:49:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 11:49:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 11:49:04,843 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-01-24 11:49:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:04,844 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 11:49:04,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:49:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 11:49:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:49:04,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:04,845 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:04,845 INFO L371 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash 274771066, now seen corresponding path program 1 times [2018-01-24 11:49:04,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:04,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:04,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:04,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:04,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:04,894 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 11:49:04,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:04,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:49:04,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:49:04,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:49:04,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:49:04,895 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-01-24 11:49:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:04,926 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-24 11:49:04,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:49:04,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 11:49:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:04,928 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:49:04,928 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 11:49:04,929 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:49:04,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 11:49:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 11:49:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 11:49:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 11:49:04,935 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2018-01-24 11:49:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:04,935 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 11:49:04,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:49:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 11:49:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:49:04,936 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:04,936 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:04,936 INFO L371 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:04,937 INFO L82 PathProgramCache]: Analyzing trace with hash 274771112, now seen corresponding path program 1 times [2018-01-24 11:49:04,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:04,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:04,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:04,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:04,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:05,117 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 11:49:05,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:05,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:49:05,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:49:05,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:49:05,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:49:05,118 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 8 states. [2018-01-24 11:49:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:05,451 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2018-01-24 11:49:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:49:05,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-01-24 11:49:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:05,455 INFO L225 Difference]: With dead ends: 70 [2018-01-24 11:49:05,455 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 11:49:05,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:49:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 11:49:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-01-24 11:49:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:49:05,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 11:49:05,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 16 [2018-01-24 11:49:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:05,466 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 11:49:05,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:49:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 11:49:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 11:49:05,467 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:05,468 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:05,468 INFO L371 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash -72030156, now seen corresponding path program 1 times [2018-01-24 11:49:05,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:05,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:05,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:05,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:05,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:05,594 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 11:49:05,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:05,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:49:05,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:49:05,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:49:05,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:49:05,595 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-01-24 11:49:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:05,740 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-01-24 11:49:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:49:05,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 11:49:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:05,742 INFO L225 Difference]: With dead ends: 88 [2018-01-24 11:49:05,742 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 11:49:05,742 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:49:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 11:49:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-01-24 11:49:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 11:49:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-01-24 11:49:05,749 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 17 [2018-01-24 11:49:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:05,749 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-01-24 11:49:05,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:49:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-01-24 11:49:05,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 11:49:05,750 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:05,750 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 11:49:05,750 INFO L371 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:05,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1045798781, now seen corresponding path program 1 times [2018-01-24 11:49:05,751 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:05,751 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:05,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:05,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:05,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:05,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:49:05,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:49:05,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:49:05,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:49:05,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:49:05,796 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2018-01-24 11:49:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:05,868 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-24 11:49:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:49:05,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 11:49:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:05,869 INFO L225 Difference]: With dead ends: 63 [2018-01-24 11:49:05,869 INFO L226 Difference]: Without dead ends: 56 [2018-01-24 11:49:05,869 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 11:49:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-24 11:49:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-24 11:49:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 11:49:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-01-24 11:49:05,878 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-01-24 11:49:05,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:05,879 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-01-24 11:49:05,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:49:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-01-24 11:49:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 11:49:05,880 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:05,880 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] [2018-01-24 11:49:05,880 INFO L371 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:05,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1880509326, now seen corresponding path program 1 times [2018-01-24 11:49:05,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:05,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:05,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:05,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:05,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:05,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:05,981 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:06,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:06,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:06,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:06,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-01-24 11:49:06,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:49:06,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:49:06,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:49:06,152 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 14 states. [2018-01-24 11:49:06,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:06,560 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 11:49:06,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:49:06,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-01-24 11:49:06,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:06,562 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:49:06,562 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 11:49:06,562 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:49:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 11:49:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-01-24 11:49:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:49:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-01-24 11:49:06,571 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 22 [2018-01-24 11:49:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:06,572 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-01-24 11:49:06,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:49:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-01-24 11:49:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:49:06,573 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:06,573 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:49:06,573 INFO L371 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:06,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1833751648, now seen corresponding path program 1 times [2018-01-24 11:49:06,574 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:06,574 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:06,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:06,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:06,575 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:06,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:06,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:06,652 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:06,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:06,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:06,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:06,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 13 [2018-01-24 11:49:06,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 11:49:06,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 11:49:06,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:49:06,804 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 14 states. [2018-01-24 11:49:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:07,062 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2018-01-24 11:49:07,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 11:49:07,062 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-01-24 11:49:07,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:07,063 INFO L225 Difference]: With dead ends: 93 [2018-01-24 11:49:07,063 INFO L226 Difference]: Without dead ends: 90 [2018-01-24 11:49:07,064 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-01-24 11:49:07,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-24 11:49:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 53. [2018-01-24 11:49:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:49:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 11:49:07,075 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 23 [2018-01-24 11:49:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:07,076 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 11:49:07,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 11:49:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 11:49:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:49:07,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:49:07,077 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] [2018-01-24 11:49:07,077 INFO L371 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 11:49:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1011769969, now seen corresponding path program 1 times [2018-01-24 11:49:07,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:49:07,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:49:07,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:07,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:07,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:49:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:07,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:49:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:07,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:49:07,278 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:49:07,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:49:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:49:07,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:49:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:49:07,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:49:07,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-01-24 11:49:07,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:49:07,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:49:07,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:49:07,452 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 17 states. [2018-01-24 11:49:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:49:07,759 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-01-24 11:49:07,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 11:49:07,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-24 11:49:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:49:07,760 INFO L225 Difference]: With dead ends: 74 [2018-01-24 11:49:07,760 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 11:49:07,761 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-01-24 11:49:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 11:49:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 11:49:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 11:49:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 11:49:07,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-24 11:49:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:49:07,762 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 11:49:07,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:49:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 11:49:07,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 11:49:07,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 11:49:08,201 WARN L146 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 82 DAG size of output 52 [2018-01-24 11:49:08,418 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 68 DAG size of output 46 [2018-01-24 11:49:08,442 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,442 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:08,442 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,442 INFO L401 ceAbstractionStarter]: For program point SelectionSortEXIT(lines 540 556) no Hoare annotation was computed. [2018-01-24 11:49:08,442 INFO L401 ceAbstractionStarter]: For program point L553'(line 553) no Hoare annotation was computed. [2018-01-24 11:49:08,442 INFO L404 ceAbstractionStarter]: At program point SelectionSortENTRY(lines 540 556) the Hoare annotation is: true [2018-01-24 11:49:08,442 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 555) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point L549(line 549) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr6RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 551) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr10RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr7RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point L543'''(lines 543 555) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr4RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr9RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point L547''''(lines 547 551) no Hoare annotation was computed. [2018-01-24 11:49:08,443 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr1RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L397 ceAbstractionStarter]: At program point L543''(lines 543 555) the Hoare annotation is: (let ((.cse5 (select |#length| SelectionSort_~a.base))) (let ((.cse2 (= 1 (select |#valid| SelectionSort_~a.base))) (.cse0 (= SelectionSort_~a.offset 0)) (.cse1 (<= (* 4 SelectionSort_~array_size) .cse5))) (or (and .cse0 .cse1 (let ((.cse3 (<= 0 SelectionSort_~i~2)) (.cse6 (<= (+ SelectionSort_~min~3 1) SelectionSort_~j~3))) (or (let ((.cse4 (* 4 SelectionSort_~min~3))) (and .cse2 .cse3 (<= 0 (+ SelectionSort_~a.offset .cse4)) (<= (+ SelectionSort_~a.offset .cse4 8) .cse5) .cse6)) (and .cse2 (<= 1 SelectionSort_~min~3) .cse3 .cse6)))) (and .cse2 .cse0 (= SelectionSort_~i~2 0) .cse1) (< (select |#length| |SelectionSort_#in~a.base|) (* 4 |SelectionSort_#in~array_size|)) (not (= (select |#valid| |SelectionSort_#in~a.base|) 1)) (not (= 0 |SelectionSort_#in~a.offset|))))) [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point L549''(line 549) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point L547''(lines 547 551) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr0RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point L553''(line 553) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L397 ceAbstractionStarter]: At program point L547'''(lines 547 551) the Hoare annotation is: (let ((.cse4 (select |#length| SelectionSort_~a.base))) (let ((.cse1 (= SelectionSort_~a.offset 0)) (.cse0 (= 1 (select |#valid| SelectionSort_~a.base))) (.cse2 (<= 0 SelectionSort_~i~2)) (.cse5 (<= (+ SelectionSort_~min~3 1) SelectionSort_~j~3)) (.cse3 (* 4 SelectionSort_~min~3)) (.cse6 (+ SelectionSort_~i~2 1)) (.cse7 (<= (* 4 SelectionSort_~array_size) .cse4))) (or (and .cse0 .cse1 .cse2 (<= (+ .cse3 4) .cse4) .cse5 (<= .cse6 SelectionSort_~min~3) .cse7) (and .cse1 (and (exists ((SelectionSort_~j~3 Int)) (and (<= (+ SelectionSort_~i~2 1) SelectionSort_~j~3) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~3) 4) (select |#length| SelectionSort_~a.base)))) .cse0 .cse2 (<= (+ SelectionSort_~a.offset .cse3 8) .cse4) .cse5 (<= 0 (+ SelectionSort_~a.offset .cse3)) (<= .cse6 SelectionSort_~j~3)) .cse7) (< (select |#length| |SelectionSort_#in~a.base|) (* 4 |SelectionSort_#in~array_size|)) (not (= (select |#valid| |SelectionSort_#in~a.base|) 1)) (not (= 0 |SelectionSort_#in~a.offset|))))) [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr3RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-24 11:49:08,444 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr2RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr8RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr11RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point SelectionSortErr5RequiresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point L549'(line 549) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L397 ceAbstractionStarter]: At program point L563(line 563) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= .cse0 (select |#length| main_~numbers~5.base)) (= 0 main_~numbers~5.offset) (= 0 |main_#t~malloc9.offset|) (= 1 (select |#valid| main_~numbers~5.base)) (= 1 (select |#valid| |main_#t~malloc9.base|)) (= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|) (= .cse0 (select |#length| |main_#t~malloc9.base|)))) [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-24 11:49:08,445 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-24 11:49:08,446 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-24 11:49:08,446 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 557 565) no Hoare annotation was computed. [2018-01-24 11:49:08,446 INFO L401 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2018-01-24 11:49:08,446 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 557 565) no Hoare annotation was computed. [2018-01-24 11:49:08,446 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 557 565) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 11:49:08,446 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-24 11:49:08,446 INFO L401 ceAbstractionStarter]: For program point L559''(lines 559 561) no Hoare annotation was computed. [2018-01-24 11:49:08,446 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 557 565) no Hoare annotation was computed. [2018-01-24 11:49:08,450 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,451 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,453 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,454 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,457 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,457 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,458 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,459 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,462 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,462 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,462 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,462 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,465 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,466 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:49:08 BoogieIcfgContainer [2018-01-24 11:49:08,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:49:08,469 INFO L168 Benchmark]: Toolchain (without parser) took 4863.79 ms. Allocated memory was 299.4 MB in the beginning and 510.1 MB in the end (delta: 210.8 MB). Free memory was 259.3 MB in the beginning and 434.6 MB in the end (delta: -175.3 MB). Peak memory consumption was 168.4 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:08,470 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 299.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:49:08,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.01 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 248.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:08,471 INFO L168 Benchmark]: Boogie Preprocessor took 31.21 ms. Allocated memory is still 299.4 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:08,471 INFO L168 Benchmark]: RCFGBuilder took 290.29 ms. Allocated memory is still 299.4 MB. Free memory was 246.3 MB in the beginning and 228.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:08,472 INFO L168 Benchmark]: TraceAbstraction took 4336.11 ms. Allocated memory was 299.4 MB in the beginning and 510.1 MB in the end (delta: 210.8 MB). Free memory was 228.3 MB in the beginning and 434.6 MB in the end (delta: -206.3 MB). Peak memory consumption was 137.4 MB. Max. memory is 5.3 GB. [2018-01-24 11:49:08,474 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.17 ms. Allocated memory is still 299.4 MB. Free memory is still 265.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.01 ms. Allocated memory is still 299.4 MB. Free memory was 258.3 MB in the beginning and 248.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.21 ms. Allocated memory is still 299.4 MB. Free memory was 248.3 MB in the beginning and 246.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.29 ms. Allocated memory is still 299.4 MB. Free memory was 246.3 MB in the beginning and 228.3 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4336.11 ms. Allocated memory was 299.4 MB in the beginning and 510.1 MB in the end (delta: 210.8 MB). Free memory was 228.3 MB in the beginning and 434.6 MB in the end (delta: -206.3 MB). Peak memory consumption was 137.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,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 * 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: 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: 557]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - InvariantResult [Line: 547]: Loop Invariant [2018-01-24 11:49:08,481 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,481 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,481 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,482 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,484 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[SelectionSort_~j~3,QUANTIFIED] [2018-01-24 11:49:08,485 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,485 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,485 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,486 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,486 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,486 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((1 == \valid[a] && a == 0) && 0 <= i) && 4 * min + 4 <= unknown-#length-unknown[a]) && min + 1 <= j) && i + 1 <= min) && 4 * array_size <= unknown-#length-unknown[a]) || ((a == 0 && ((((((\exists SelectionSort_~j~3 : int :: i + 1 <= SelectionSort_~j~3 && a + 4 * SelectionSort_~j~3 + 4 <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 0 <= i) && a + 4 * min + 8 <= unknown-#length-unknown[a]) && min + 1 <= j) && 0 <= a + 4 * min) && i + 1 <= j) && 4 * array_size <= unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4 * \old(array_size)) || !(\valid[a] == 1)) || !(0 == a) - InvariantResult [Line: 543]: Loop Invariant [2018-01-24 11:49:08,488 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,488 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,488 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,488 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,490 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 11:49:08,491 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((a == 0 && 4 * array_size <= unknown-#length-unknown[a]) && (((((1 == \valid[a] && 0 <= i) && 0 <= a + 4 * min) && a + 4 * min + 8 <= unknown-#length-unknown[a]) && min + 1 <= j) || (((1 == \valid[a] && 1 <= min) && 0 <= i) && min + 1 <= j))) || (((1 == \valid[a] && a == 0) && i == 0) && 4 * array_size <= unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4 * \old(array_size)) || !(\valid[a] == 1)) || !(0 == a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 13 error locations. SAFE Result, 4.2s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 260 SDtfs, 761 SDslu, 714 SDs, 0 SdLazy, 908 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 19 NumberOfFragments, 265 HoareAnnotationTreeSize, 8 FomulaSimplifications, 746 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1435 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 225 ConstructedInterpolants, 7 QuantifiedInterpolants, 28121 SizeOfPredicates, 11 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/16 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/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-49-08-497.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-49-08-497.csv Received shutdown request...