java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:40,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:40,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:40,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:40,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:40,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:40,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:40,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:40,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:40,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:40,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:40,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:40,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:40,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:40,427 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:40,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:40,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:40,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:40,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:40,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:40,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:40,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:40,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:40,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:40,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:40,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:40,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:40,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:40,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:40,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:40,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:40,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:40,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:40,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:40,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:40,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:40,451 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:42:40,477 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:40,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:40,479 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:40,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:40,479 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:40,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:40,480 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:40,480 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:40,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:40,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:40,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:40,483 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:40,483 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:40,483 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:40,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:40,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:40,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:40,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:40,484 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:40,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:40,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:40,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:40,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:40,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:40,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:40,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:42:40,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:40,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:40,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:40,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:40,556 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:40,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:40,915 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b466dd7c/ac5ab2b525994ef69e92c274f019c849/FLAGad552b96d [2018-10-10 14:42:41,142 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:41,143 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:41,162 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b466dd7c/ac5ab2b525994ef69e92c274f019c849/FLAGad552b96d [2018-10-10 14:42:41,182 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b466dd7c/ac5ab2b525994ef69e92c274f019c849 [2018-10-10 14:42:41,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:41,193 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:41,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:41,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:41,198 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:41,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bfce93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41, skipping insertion in model container [2018-10-10 14:42:41,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:41,259 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:41,502 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:41,517 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:41,568 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:41,635 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:41,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41 WrapperNode [2018-10-10 14:42:41,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:41,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:41,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:41,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:41,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:41,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:41,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:41,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:41,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... [2018-10-10 14:42:41,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:41,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:41,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:41,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:41,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (1/1) ... No working directory specified, using /storage/repos/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-10-10 14:42:41,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:41,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:42,761 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:42,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:42 BoogieIcfgContainer [2018-10-10 14:42:42,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:42,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:42,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:42,766 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:42,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:41" (1/3) ... [2018-10-10 14:42:42,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a42d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:42, skipping insertion in model container [2018-10-10 14:42:42,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:41" (2/3) ... [2018-10-10 14:42:42,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a42d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:42, skipping insertion in model container [2018-10-10 14:42:42,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:42" (3/3) ... [2018-10-10 14:42:42,770 INFO L112 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:42,781 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:42,790 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-10-10 14:42:42,808 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-10-10 14:42:42,836 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:42,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:42,837 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:42,838 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:42,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:42,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:42,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:42,839 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:42,839 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2018-10-10 14:42:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-10 14:42:42,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:42,871 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:42,874 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:42,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:42,881 INFO L82 PathProgramCache]: Analyzing trace with hash -663224519, now seen corresponding path program 1 times [2018-10-10 14:42:42,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:42,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:42,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:42,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:43,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:43,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:42:43,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:42:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:42:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:42:43,064 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 2 states. [2018-10-10 14:42:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:43,087 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-10-10 14:42:43,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:42:43,088 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-10-10 14:42:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:43,102 INFO L225 Difference]: With dead ends: 145 [2018-10-10 14:42:43,102 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 14:42:43,104 INFO L605 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-10-10 14:42:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 14:42:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-10 14:42:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 14:42:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-10-10 14:42:43,155 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 43 [2018-10-10 14:42:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:43,156 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-10-10 14:42:43,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:42:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-10-10 14:42:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-10 14:42:43,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:43,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:43,158 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:43,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:43,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1273564416, now seen corresponding path program 1 times [2018-10-10 14:42:43,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:43,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:43,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:43,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:43,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:43,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:43,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:43,550 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 9 states. [2018-10-10 14:42:44,267 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:42:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:44,608 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-10-10 14:42:44,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:42:44,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-10-10 14:42:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:44,611 INFO L225 Difference]: With dead ends: 139 [2018-10-10 14:42:44,611 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 14:42:44,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 14:42:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-10-10 14:42:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 14:42:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2018-10-10 14:42:44,624 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 44 [2018-10-10 14:42:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:44,625 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2018-10-10 14:42:44,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2018-10-10 14:42:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-10 14:42:44,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:44,627 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:44,628 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:44,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:44,628 INFO L82 PathProgramCache]: Analyzing trace with hash 872006255, now seen corresponding path program 1 times [2018-10-10 14:42:44,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:44,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:44,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:44,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:44,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:44,774 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand 8 states. [2018-10-10 14:42:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:45,297 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-10-10 14:42:45,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:45,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-10-10 14:42:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:45,299 INFO L225 Difference]: With dead ends: 138 [2018-10-10 14:42:45,299 INFO L226 Difference]: Without dead ends: 138 [2018-10-10 14:42:45,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-10 14:42:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2018-10-10 14:42:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 14:42:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-10-10 14:42:45,309 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 44 [2018-10-10 14:42:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:45,310 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-10-10 14:42:45,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-10-10 14:42:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 14:42:45,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:45,312 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:45,312 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:45,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1262390267, now seen corresponding path program 1 times [2018-10-10 14:42:45,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:45,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:45,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:45,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:45,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:42:45,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:42:45,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:42:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:42:45,396 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 4 states. [2018-10-10 14:42:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:45,533 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-10-10 14:42:45,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 14:42:45,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-10-10 14:42:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:45,535 INFO L225 Difference]: With dead ends: 127 [2018-10-10 14:42:45,535 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 14:42:45,536 INFO L605 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-10-10 14:42:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 14:42:45,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-10 14:42:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 14:42:45,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 130 transitions. [2018-10-10 14:42:45,546 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 130 transitions. Word has length 45 [2018-10-10 14:42:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:45,546 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 130 transitions. [2018-10-10 14:42:45,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:42:45,547 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 130 transitions. [2018-10-10 14:42:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 14:42:45,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:45,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:45,549 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:45,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:45,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1262975165, now seen corresponding path program 1 times [2018-10-10 14:42:45,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:45,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:45,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:45,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:45,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:42:45,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:42:45,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:42:45,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:45,878 INFO L87 Difference]: Start difference. First operand 127 states and 130 transitions. Second operand 14 states. [2018-10-10 14:42:46,694 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-10 14:42:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:47,366 INFO L93 Difference]: Finished difference Result 249 states and 255 transitions. [2018-10-10 14:42:47,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:47,367 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-10-10 14:42:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:47,369 INFO L225 Difference]: With dead ends: 249 [2018-10-10 14:42:47,369 INFO L226 Difference]: Without dead ends: 249 [2018-10-10 14:42:47,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:42:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-10 14:42:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 140. [2018-10-10 14:42:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 14:42:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-10-10 14:42:47,380 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 45 [2018-10-10 14:42:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:47,380 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-10-10 14:42:47,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:42:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-10-10 14:42:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-10 14:42:47,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:47,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 14:42:47,383 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:47,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1081292259, now seen corresponding path program 1 times [2018-10-10 14:42:47,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:47,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:47,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:47,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:47,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:47,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:47,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:47,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:47,721 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 13 states. [2018-10-10 14:42:48,456 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-10 14:42:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:48,893 INFO L93 Difference]: Finished difference Result 309 states and 316 transitions. [2018-10-10 14:42:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:48,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2018-10-10 14:42:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:48,897 INFO L225 Difference]: With dead ends: 309 [2018-10-10 14:42:48,897 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 14:42:48,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=432, Unknown=0, NotChecked=0, Total=650 [2018-10-10 14:42:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 14:42:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 219. [2018-10-10 14:42:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 14:42:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 229 transitions. [2018-10-10 14:42:48,911 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 229 transitions. Word has length 55 [2018-10-10 14:42:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:48,911 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 229 transitions. [2018-10-10 14:42:48,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 229 transitions. [2018-10-10 14:42:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:42:48,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:48,914 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:48,915 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:48,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash 689879634, now seen corresponding path program 1 times [2018-10-10 14:42:48,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:48,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:48,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:50,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:50,269 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-10 14:42:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:50,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:50,397 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 6 treesize of output 5 [2018-10-10 14:42:50,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:50,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:50,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:51,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:51,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2018-10-10 14:42:51,165 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/selectionsort-alloca_true-valid-memsafety_true-termination.i_7.bpl [2018-10-10 14:42:51,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 14:42:51,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 14:42:51,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:42:51,173 INFO L87 Difference]: Start difference. First operand 219 states and 229 transitions. Second operand 19 states. [2018-10-10 14:42:52,123 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-10 14:42:52,348 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-10-10 14:42:52,944 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-10-10 14:42:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:53,194 INFO L93 Difference]: Finished difference Result 273 states and 283 transitions. [2018-10-10 14:42:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:53,194 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-10-10 14:42:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:53,197 INFO L225 Difference]: With dead ends: 273 [2018-10-10 14:42:53,197 INFO L226 Difference]: Without dead ends: 273 [2018-10-10 14:42:53,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=269, Invalid=723, Unknown=0, NotChecked=0, Total=992 [2018-10-10 14:42:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-10 14:42:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 214. [2018-10-10 14:42:53,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-10 14:42:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 222 transitions. [2018-10-10 14:42:53,206 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 222 transitions. Word has length 73 [2018-10-10 14:42:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:53,207 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 222 transitions. [2018-10-10 14:42:53,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 14:42:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 222 transitions. [2018-10-10 14:42:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:42:53,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:53,210 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:53,211 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:53,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 924135206, now seen corresponding path program 1 times [2018-10-10 14:42:53,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:53,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:53,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:53,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:53,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:53,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:53,525 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-10 14:42:53,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:53,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:53,600 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 6 treesize of output 5 [2018-10-10 14:42:53,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:53,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:53,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:53,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:53,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 19 [2018-10-10 14:42:54,008 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/selectionsort-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:42:54,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:42:54,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:42:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:42:54,010 INFO L87 Difference]: Start difference. First operand 214 states and 222 transitions. Second operand 20 states. [2018-10-10 14:42:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:56,937 INFO L93 Difference]: Finished difference Result 521 states and 534 transitions. [2018-10-10 14:42:56,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:42:56,938 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 84 [2018-10-10 14:42:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:56,941 INFO L225 Difference]: With dead ends: 521 [2018-10-10 14:42:56,941 INFO L226 Difference]: Without dead ends: 521 [2018-10-10 14:42:56,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=597, Invalid=1383, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 14:42:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-10-10 14:42:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 228. [2018-10-10 14:42:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 14:42:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 238 transitions. [2018-10-10 14:42:56,952 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 238 transitions. Word has length 84 [2018-10-10 14:42:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:56,952 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 238 transitions. [2018-10-10 14:42:56,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:42:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 238 transitions. [2018-10-10 14:42:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 14:42:56,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:56,956 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:56,956 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:56,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1614552165, now seen corresponding path program 1 times [2018-10-10 14:42:56,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:57,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:57,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-10 14:42:57,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:57,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:57,371 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 6 treesize of output 5 [2018-10-10 14:42:57,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:57,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:57,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:57,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:57,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2018-10-10 14:42:57,868 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/selectionsort-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:42:57,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:42:57,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:42:57,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:42:57,871 INFO L87 Difference]: Start difference. First operand 228 states and 238 transitions. Second operand 20 states. [2018-10-10 14:42:58,717 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-10 14:42:58,946 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-10 14:43:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:00,116 INFO L93 Difference]: Finished difference Result 465 states and 486 transitions. [2018-10-10 14:43:00,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:43:00,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-10-10 14:43:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:00,120 INFO L225 Difference]: With dead ends: 465 [2018-10-10 14:43:00,120 INFO L226 Difference]: Without dead ends: 465 [2018-10-10 14:43:00,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=364, Invalid=968, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:43:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-10-10 14:43:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 276. [2018-10-10 14:43:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 14:43:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 289 transitions. [2018-10-10 14:43:00,129 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 289 transitions. Word has length 86 [2018-10-10 14:43:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:00,129 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 289 transitions. [2018-10-10 14:43:00,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:43:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 289 transitions. [2018-10-10 14:43:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:43:00,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:00,132 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:00,132 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:00,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 490397917, now seen corresponding path program 1 times [2018-10-10 14:43:00,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:00,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:00,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:00,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:43:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:00,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:00,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:00,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:00,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:00,296 INFO L87 Difference]: Start difference. First operand 276 states and 289 transitions. Second operand 8 states. [2018-10-10 14:43:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:00,624 INFO L93 Difference]: Finished difference Result 308 states and 321 transitions. [2018-10-10 14:43:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:00,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2018-10-10 14:43:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:00,627 INFO L225 Difference]: With dead ends: 308 [2018-10-10 14:43:00,627 INFO L226 Difference]: Without dead ends: 308 [2018-10-10 14:43:00,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-10 14:43:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 274. [2018-10-10 14:43:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-10 14:43:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 287 transitions. [2018-10-10 14:43:00,634 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 287 transitions. Word has length 95 [2018-10-10 14:43:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:00,634 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 287 transitions. [2018-10-10 14:43:00,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 287 transitions. [2018-10-10 14:43:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:43:00,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:00,636 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:00,637 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:00,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:00,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1977533592, now seen corresponding path program 1 times [2018-10-10 14:43:00,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:00,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:00,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:00,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:00,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:43:01,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:01,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:43:01,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:43:01,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:43:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:01,115 INFO L87 Difference]: Start difference. First operand 274 states and 287 transitions. Second operand 14 states. [2018-10-10 14:43:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:01,809 INFO L93 Difference]: Finished difference Result 273 states and 286 transitions. [2018-10-10 14:43:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:43:01,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2018-10-10 14:43:01,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:01,811 INFO L225 Difference]: With dead ends: 273 [2018-10-10 14:43:01,812 INFO L226 Difference]: Without dead ends: 273 [2018-10-10 14:43:01,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:43:01,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-10 14:43:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-10-10 14:43:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 14:43:01,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 286 transitions. [2018-10-10 14:43:01,818 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 286 transitions. Word has length 96 [2018-10-10 14:43:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:01,818 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 286 transitions. [2018-10-10 14:43:01,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:43:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 286 transitions. [2018-10-10 14:43:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 14:43:01,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:01,820 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:01,820 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:01,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:01,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1346085564, now seen corresponding path program 1 times [2018-10-10 14:43:01,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:01,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:01,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:01,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:43:02,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:02,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:43:02,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:43:02,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:43:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:02,630 INFO L87 Difference]: Start difference. First operand 273 states and 286 transitions. Second operand 16 states. [2018-10-10 14:43:03,552 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-10-10 14:43:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:04,486 INFO L93 Difference]: Finished difference Result 546 states and 569 transitions. [2018-10-10 14:43:04,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:43:04,486 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2018-10-10 14:43:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:04,490 INFO L225 Difference]: With dead ends: 546 [2018-10-10 14:43:04,490 INFO L226 Difference]: Without dead ends: 546 [2018-10-10 14:43:04,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=284, Invalid=646, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:43:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-10-10 14:43:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 339. [2018-10-10 14:43:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 14:43:04,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 354 transitions. [2018-10-10 14:43:04,499 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 354 transitions. Word has length 107 [2018-10-10 14:43:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:04,500 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 354 transitions. [2018-10-10 14:43:04,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:43:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 354 transitions. [2018-10-10 14:43:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:43:04,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:04,502 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:04,502 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:04,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash 436265266, now seen corresponding path program 1 times [2018-10-10 14:43:04,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:04,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:04,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:04,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:05,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:05,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:05,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:05,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:05,231 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 6 treesize of output 5 [2018-10-10 14:43:05,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:05,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:05,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:43:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:05,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:05,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2018-10-10 14:43:05,830 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/selectionsort-alloca_true-valid-memsafety_true-termination.i_13.bpl [2018-10-10 14:43:05,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:43:05,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:43:05,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:43:05,833 INFO L87 Difference]: Start difference. First operand 339 states and 354 transitions. Second operand 20 states. [2018-10-10 14:43:06,286 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 14:43:06,847 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-10 14:43:07,010 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-10-10 14:43:07,573 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-10-10 14:43:08,028 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-10 14:43:08,266 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-10-10 14:43:08,517 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-10-10 14:43:08,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:08,740 INFO L93 Difference]: Finished difference Result 670 states and 697 transitions. [2018-10-10 14:43:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 14:43:08,740 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-10-10 14:43:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:08,745 INFO L225 Difference]: With dead ends: 670 [2018-10-10 14:43:08,745 INFO L226 Difference]: Without dead ends: 670 [2018-10-10 14:43:08,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=431, Invalid=1051, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:43:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-10 14:43:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 371. [2018-10-10 14:43:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-10 14:43:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 389 transitions. [2018-10-10 14:43:08,754 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 389 transitions. Word has length 108 [2018-10-10 14:43:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:08,754 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 389 transitions. [2018-10-10 14:43:08,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:43:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 389 transitions. [2018-10-10 14:43:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 14:43:08,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:08,756 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:08,756 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:08,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1062607248, now seen corresponding path program 1 times [2018-10-10 14:43:08,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:08,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:08,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:08,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:09,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:09,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:09,149 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-10 14:43:09,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:09,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:09,229 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 6 treesize of output 5 [2018-10-10 14:43:09,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:43:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:09,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:09,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 21 [2018-10-10 14:43:09,613 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/selectionsort-alloca_true-valid-memsafety_true-termination.i_14.bpl [2018-10-10 14:43:09,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 14:43:09,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 14:43:09,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:43:09,615 INFO L87 Difference]: Start difference. First operand 371 states and 389 transitions. Second operand 22 states. [2018-10-10 14:43:10,683 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-10-10 14:43:10,986 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-10 14:43:11,410 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-10-10 14:43:11,612 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-10-10 14:43:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:12,302 INFO L93 Difference]: Finished difference Result 465 states and 484 transitions. [2018-10-10 14:43:12,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:43:12,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 114 [2018-10-10 14:43:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:12,307 INFO L225 Difference]: With dead ends: 465 [2018-10-10 14:43:12,307 INFO L226 Difference]: Without dead ends: 465 [2018-10-10 14:43:12,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=508, Invalid=1298, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 14:43:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-10-10 14:43:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 357. [2018-10-10 14:43:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-10 14:43:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 373 transitions. [2018-10-10 14:43:12,316 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 373 transitions. Word has length 114 [2018-10-10 14:43:12,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:12,316 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 373 transitions. [2018-10-10 14:43:12,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 14:43:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 373 transitions. [2018-10-10 14:43:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 14:43:12,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:12,318 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:12,319 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:12,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash 230473981, now seen corresponding path program 1 times [2018-10-10 14:43:12,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:12,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:12,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:12,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:12,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:12,696 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:12,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:12,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:12,754 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 6 treesize of output 5 [2018-10-10 14:43:12,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:12,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:12,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:43:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:13,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:13,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 21 [2018-10-10 14:43:13,149 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/selectionsort-alloca_true-valid-memsafety_true-termination.i_15.bpl [2018-10-10 14:43:13,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 14:43:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 14:43:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:43:13,151 INFO L87 Difference]: Start difference. First operand 357 states and 373 transitions. Second operand 22 states. [2018-10-10 14:43:15,101 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-10-10 14:43:15,507 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-10-10 14:43:16,026 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-10-10 14:43:16,417 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-10-10 14:43:16,710 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-10-10 14:43:16,901 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-10 14:43:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:16,993 INFO L93 Difference]: Finished difference Result 614 states and 636 transitions. [2018-10-10 14:43:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:43:16,994 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-10-10 14:43:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:16,997 INFO L225 Difference]: With dead ends: 614 [2018-10-10 14:43:16,997 INFO L226 Difference]: Without dead ends: 614 [2018-10-10 14:43:16,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=578, Invalid=1402, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 14:43:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-10 14:43:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 233. [2018-10-10 14:43:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-10 14:43:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 241 transitions. [2018-10-10 14:43:17,004 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 241 transitions. Word has length 136 [2018-10-10 14:43:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:17,005 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 241 transitions. [2018-10-10 14:43:17,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 14:43:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 241 transitions. [2018-10-10 14:43:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 14:43:17,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:17,007 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:17,007 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:17,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1057736912, now seen corresponding path program 1 times [2018-10-10 14:43:17,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:17,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:17,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-10 14:43:17,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:17,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:17,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:17,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-10 14:43:17,375 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/selectionsort-alloca_true-valid-memsafety_true-termination.i_16.bpl [2018-10-10 14:43:17,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:17,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:17,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:17,380 INFO L87 Difference]: Start difference. First operand 233 states and 241 transitions. Second operand 6 states. [2018-10-10 14:43:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:17,614 INFO L93 Difference]: Finished difference Result 476 states and 492 transitions. [2018-10-10 14:43:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:43:17,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2018-10-10 14:43:17,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:17,616 INFO L225 Difference]: With dead ends: 476 [2018-10-10 14:43:17,617 INFO L226 Difference]: Without dead ends: 428 [2018-10-10 14:43:17,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-10 14:43:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 342. [2018-10-10 14:43:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-10 14:43:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 357 transitions. [2018-10-10 14:43:17,623 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 357 transitions. Word has length 138 [2018-10-10 14:43:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:17,623 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 357 transitions. [2018-10-10 14:43:17,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 357 transitions. [2018-10-10 14:43:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-10 14:43:17,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:17,625 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:17,625 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:17,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:17,626 INFO L82 PathProgramCache]: Analyzing trace with hash 376873403, now seen corresponding path program 2 times [2018-10-10 14:43:17,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:17,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:17,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:17,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:18,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:18,056 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:18,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:18,111 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:18,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:18,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:18,124 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 6 treesize of output 5 [2018-10-10 14:43:18,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:18,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:18,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:43:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-10 14:43:18,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:18,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2018-10-10 14:43:18,596 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:18,600 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:18,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:18 BoogieIcfgContainer [2018-10-10 14:43:18,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:18,601 INFO L168 Benchmark]: Toolchain (without parser) took 37408.96 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -292.9 MB). Peak memory consumption was 800.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:18,602 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:18,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:18,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:18,605 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:18,605 INFO L168 Benchmark]: RCFGBuilder took 1028.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:18,606 INFO L168 Benchmark]: TraceAbstraction took 35837.92 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 353.4 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 455.6 MB). Peak memory consumption was 808.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:18,610 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 442.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1028.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35837.92 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 353.4 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 455.6 MB). Peak memory consumption was 808.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 17). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 13 error locations. TIMEOUT Result, 35.7s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2207 SDtfs, 19391 SDslu, 8407 SDs, 0 SdLazy, 5482 SolverSat, 507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1100 GetRequests, 697 SyntacticMatches, 30 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 20.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1868 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 2052 NumberOfCodeBlocks, 2052 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2029 ConstructedInterpolants, 127 QuantifiedInterpolants, 2185020 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1379 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 70/232 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...