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/bubblesort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:30,124 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:30,126 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:30,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:30,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:30,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:30,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:30,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:30,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:30,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:30,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:30,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:30,155 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:30,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:30,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:30,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:30,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:30,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:30,175 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:30,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:30,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:30,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:30,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:30,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:30,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:30,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:30,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:30,196 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:30,197 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:30,200 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:30,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:30,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:30,201 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:30,201 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:30,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:30,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:30,207 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:41:30,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:30,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:30,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:30,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:30,236 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:30,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:30,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:30,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:30,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:30,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:30,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:30,239 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:30,239 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:30,239 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:30,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:30,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:30,240 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:30,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:30,240 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:30,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:30,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:30,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:30,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:30,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:30,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:30,243 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:41:30,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:30,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:30,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:30,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:30,321 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:30,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:30,647 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ee80411/f584e0455df74ba88d96bca3e220de9c/FLAGbe61a98fd [2018-10-10 14:41:30,978 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:30,978 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:30,992 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ee80411/f584e0455df74ba88d96bca3e220de9c/FLAGbe61a98fd [2018-10-10 14:41:31,006 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53ee80411/f584e0455df74ba88d96bca3e220de9c [2018-10-10 14:41:31,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:31,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:31,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:31,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:31,024 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:31,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e657dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31, skipping insertion in model container [2018-10-10 14:41:31,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:31,098 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:31,349 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:31,360 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:31,434 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:31,503 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:31,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31 WrapperNode [2018-10-10 14:41:31,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:31,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:31,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:31,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:31,516 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:41:31" (1/1) ... [2018-10-10 14:41:31,544 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:41:31" (1/1) ... [2018-10-10 14:41:31,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:31,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:31,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:31,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:31,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (1/1) ... [2018-10-10 14:41:31,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:31,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:31,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:31,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:31,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (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:41:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:31,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:32,638 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:32,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:32 BoogieIcfgContainer [2018-10-10 14:41:32,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:32,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:32,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:32,645 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:32,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:31" (1/3) ... [2018-10-10 14:41:32,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8515b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:32, skipping insertion in model container [2018-10-10 14:41:32,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:31" (2/3) ... [2018-10-10 14:41:32,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c8515b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:32, skipping insertion in model container [2018-10-10 14:41:32,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:32" (3/3) ... [2018-10-10 14:41:32,650 INFO L112 eAbstractionObserver]: Analyzing ICFG bubblesort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:32,659 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:32,668 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-10-10 14:41:32,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-10-10 14:41:32,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:32,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:32,715 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:32,716 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:32,716 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:32,719 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:32,720 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:32,720 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:32,720 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-10-10 14:41:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 14:41:32,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:32,753 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] [2018-10-10 14:41:32,756 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:32,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:32,763 INFO L82 PathProgramCache]: Analyzing trace with hash 571583811, now seen corresponding path program 1 times [2018-10-10 14:41:32,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:32,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:32,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:33,137 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:41:33,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:33,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:33,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:33,163 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 8 states. [2018-10-10 14:41:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:34,287 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-10-10 14:41:34,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:34,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-10-10 14:41:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:34,301 INFO L225 Difference]: With dead ends: 154 [2018-10-10 14:41:34,302 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 14:41:34,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 14:41:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2018-10-10 14:41:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 14:41:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-10-10 14:41:34,348 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 42 [2018-10-10 14:41:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:34,349 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-10-10 14:41:34,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-10-10 14:41:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-10 14:41:34,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:34,351 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:41:34,352 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:34,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 539229052, now seen corresponding path program 1 times [2018-10-10 14:41:34,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:34,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:34,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:34,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:34,883 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:41:34,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:34,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:41:34,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:41:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:41:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:34,887 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 14 states. [2018-10-10 14:41:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:36,652 INFO L93 Difference]: Finished difference Result 310 states and 317 transitions. [2018-10-10 14:41:36,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:36,659 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-10-10 14:41:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:36,663 INFO L225 Difference]: With dead ends: 310 [2018-10-10 14:41:36,663 INFO L226 Difference]: Without dead ends: 310 [2018-10-10 14:41:36,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2018-10-10 14:41:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-10 14:41:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 165. [2018-10-10 14:41:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 14:41:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 172 transitions. [2018-10-10 14:41:36,687 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 172 transitions. Word has length 43 [2018-10-10 14:41:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:36,689 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 172 transitions. [2018-10-10 14:41:36,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:41:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 172 transitions. [2018-10-10 14:41:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:41:36,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:36,692 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] [2018-10-10 14:41:36,693 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:36,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1446009953, now seen corresponding path program 1 times [2018-10-10 14:41:36,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:36,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:36,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:36,809 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:41:36,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:36,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:41:36,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:36,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:36,811 INFO L87 Difference]: Start difference. First operand 165 states and 172 transitions. Second operand 6 states. [2018-10-10 14:41:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:36,886 INFO L93 Difference]: Finished difference Result 165 states and 171 transitions. [2018-10-10 14:41:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:36,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-10 14:41:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:36,893 INFO L225 Difference]: With dead ends: 165 [2018-10-10 14:41:36,893 INFO L226 Difference]: Without dead ends: 165 [2018-10-10 14:41:36,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-10 14:41:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-10 14:41:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 14:41:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 171 transitions. [2018-10-10 14:41:36,912 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 171 transitions. Word has length 46 [2018-10-10 14:41:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:36,916 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 171 transitions. [2018-10-10 14:41:36,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 171 transitions. [2018-10-10 14:41:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:41:36,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:36,918 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:41:36,920 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:36,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:36,920 INFO L82 PathProgramCache]: Analyzing trace with hash -426403980, now seen corresponding path program 1 times [2018-10-10 14:41:36,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:36,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:37,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:37,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:41:37,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:37,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:37,003 INFO L87 Difference]: Start difference. First operand 165 states and 171 transitions. Second operand 6 states. [2018-10-10 14:41:37,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:37,278 INFO L93 Difference]: Finished difference Result 261 states and 268 transitions. [2018-10-10 14:41:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:37,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-10-10 14:41:37,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:37,283 INFO L225 Difference]: With dead ends: 261 [2018-10-10 14:41:37,283 INFO L226 Difference]: Without dead ends: 261 [2018-10-10 14:41:37,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-10 14:41:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 172. [2018-10-10 14:41:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 14:41:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 179 transitions. [2018-10-10 14:41:37,306 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 179 transitions. Word has length 51 [2018-10-10 14:41:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:37,307 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 179 transitions. [2018-10-10 14:41:37,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 179 transitions. [2018-10-10 14:41:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 14:41:37,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:37,310 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] [2018-10-10 14:41:37,313 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:37,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1652214622, now seen corresponding path program 1 times [2018-10-10 14:41:37,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:37,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:37,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:37,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:37,677 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:41:37,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:37,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:41:37,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:41:37,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:41:37,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:41:37,679 INFO L87 Difference]: Start difference. First operand 172 states and 179 transitions. Second operand 15 states. [2018-10-10 14:41:38,759 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-10 14:41:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:39,373 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2018-10-10 14:41:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:41:39,374 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-10-10 14:41:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:39,377 INFO L225 Difference]: With dead ends: 279 [2018-10-10 14:41:39,377 INFO L226 Difference]: Without dead ends: 279 [2018-10-10 14:41:39,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:41:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-10 14:41:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 245. [2018-10-10 14:41:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-10 14:41:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 259 transitions. [2018-10-10 14:41:39,388 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 259 transitions. Word has length 53 [2018-10-10 14:41:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:39,388 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 259 transitions. [2018-10-10 14:41:39,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:41:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 259 transitions. [2018-10-10 14:41:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 14:41:39,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:39,390 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] [2018-10-10 14:41:39,390 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:39,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1963302249, now seen corresponding path program 1 times [2018-10-10 14:41:39,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:39,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:39,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:39,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:39,553 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:41:39,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:39,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:39,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:39,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:39,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:39,555 INFO L87 Difference]: Start difference. First operand 245 states and 259 transitions. Second operand 9 states. [2018-10-10 14:41:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:39,849 INFO L93 Difference]: Finished difference Result 244 states and 258 transitions. [2018-10-10 14:41:39,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:41:39,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-10-10 14:41:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:39,852 INFO L225 Difference]: With dead ends: 244 [2018-10-10 14:41:39,852 INFO L226 Difference]: Without dead ends: 229 [2018-10-10 14:41:39,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-10 14:41:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-10-10 14:41:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-10 14:41:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 241 transitions. [2018-10-10 14:41:39,859 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 241 transitions. Word has length 54 [2018-10-10 14:41:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:39,859 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 241 transitions. [2018-10-10 14:41:39,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 241 transitions. [2018-10-10 14:41:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 14:41:39,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:39,861 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] [2018-10-10 14:41:39,862 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:39,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1503639505, now seen corresponding path program 1 times [2018-10-10 14:41:39,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:39,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:39,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:39,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:40,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:40,211 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:41:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:40,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:40,322 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:41:40,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:40,345 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:41:40,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:41:40,891 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:41:40,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:40,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 18 [2018-10-10 14:41:40,963 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/bubblesort-alloca_true-valid-memsafety_true-termination.i_7.bpl [2018-10-10 14:41:40,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 14:41:40,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 14:41:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:41:40,968 INFO L87 Difference]: Start difference. First operand 229 states and 241 transitions. Second operand 19 states. [2018-10-10 14:41:41,431 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-10 14:41:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:43,583 INFO L93 Difference]: Finished difference Result 283 states and 289 transitions. [2018-10-10 14:41:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:41:43,583 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-10-10 14:41:43,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:43,585 INFO L225 Difference]: With dead ends: 283 [2018-10-10 14:41:43,585 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 14:41:43,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=303, Invalid=819, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:41:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 14:41:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 202. [2018-10-10 14:41:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-10 14:41:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 211 transitions. [2018-10-10 14:41:43,593 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 211 transitions. Word has length 71 [2018-10-10 14:41:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:43,593 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 211 transitions. [2018-10-10 14:41:43,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 14:41:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 211 transitions. [2018-10-10 14:41:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:41:43,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:43,595 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-10-10 14:41:43,595 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:43,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -246534455, now seen corresponding path program 1 times [2018-10-10 14:41:43,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:43,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:43,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:43,744 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:41:43,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:43,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:43,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:43,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-10-10 14:41:43,928 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/bubblesort-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:41:43,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:41:43,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:41:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:43,929 INFO L87 Difference]: Start difference. First operand 202 states and 211 transitions. Second operand 12 states. [2018-10-10 14:41:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:44,248 INFO L93 Difference]: Finished difference Result 512 states and 534 transitions. [2018-10-10 14:41:44,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:41:44,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-10-10 14:41:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:44,252 INFO L225 Difference]: With dead ends: 512 [2018-10-10 14:41:44,252 INFO L226 Difference]: Without dead ends: 504 [2018-10-10 14:41:44,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:41:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-10-10 14:41:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 348. [2018-10-10 14:41:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-10 14:41:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 371 transitions. [2018-10-10 14:41:44,261 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 371 transitions. Word has length 79 [2018-10-10 14:41:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:44,261 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 371 transitions. [2018-10-10 14:41:44,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:41:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 371 transitions. [2018-10-10 14:41:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 14:41:44,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:44,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,264 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:44,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash 877560320, now seen corresponding path program 1 times [2018-10-10 14:41:44,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:44,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:44,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:44,423 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:41:44,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:44,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:44,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:44,424 INFO L87 Difference]: Start difference. First operand 348 states and 371 transitions. Second operand 8 states. [2018-10-10 14:41:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:44,692 INFO L93 Difference]: Finished difference Result 528 states and 554 transitions. [2018-10-10 14:41:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:44,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-10-10 14:41:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:44,699 INFO L225 Difference]: With dead ends: 528 [2018-10-10 14:41:44,699 INFO L226 Difference]: Without dead ends: 528 [2018-10-10 14:41:44,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-10 14:41:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 346. [2018-10-10 14:41:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 14:41:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 363 transitions. [2018-10-10 14:41:44,710 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 363 transitions. Word has length 88 [2018-10-10 14:41:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:44,710 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 363 transitions. [2018-10-10 14:41:44,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 363 transitions. [2018-10-10 14:41:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 14:41:44,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:44,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,712 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:44,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1434566295, now seen corresponding path program 1 times [2018-10-10 14:41:44,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:44,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:46,075 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:41:46,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:46,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:41:46,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:41:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:41:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:41:46,077 INFO L87 Difference]: Start difference. First operand 346 states and 363 transitions. Second operand 15 states. [2018-10-10 14:41:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:46,939 INFO L93 Difference]: Finished difference Result 349 states and 363 transitions. [2018-10-10 14:41:46,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:46,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-10 14:41:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:46,942 INFO L225 Difference]: With dead ends: 349 [2018-10-10 14:41:46,942 INFO L226 Difference]: Without dead ends: 349 [2018-10-10 14:41:46,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:41:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-10 14:41:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2018-10-10 14:41:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 14:41:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 361 transitions. [2018-10-10 14:41:46,951 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 361 transitions. Word has length 89 [2018-10-10 14:41:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:46,951 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 361 transitions. [2018-10-10 14:41:46,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:41:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 361 transitions. [2018-10-10 14:41:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 14:41:46,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:46,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:46,953 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:46,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 298182503, now seen corresponding path program 1 times [2018-10-10 14:41:46,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:47,325 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:41:47,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:47,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:41:47,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:41:47,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:41:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:41:47,327 INFO L87 Difference]: Start difference. First operand 346 states and 361 transitions. Second operand 15 states. [2018-10-10 14:41:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:49,485 INFO L93 Difference]: Finished difference Result 532 states and 554 transitions. [2018-10-10 14:41:49,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:41:49,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-10-10 14:41:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:49,487 INFO L225 Difference]: With dead ends: 532 [2018-10-10 14:41:49,487 INFO L226 Difference]: Without dead ends: 532 [2018-10-10 14:41:49,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-10-10 14:41:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-10-10 14:41:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 346. [2018-10-10 14:41:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 14:41:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 359 transitions. [2018-10-10 14:41:49,498 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 359 transitions. Word has length 100 [2018-10-10 14:41:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:49,498 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 359 transitions. [2018-10-10 14:41:49,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:41:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 359 transitions. [2018-10-10 14:41:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 14:41:49,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:49,500 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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, 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] [2018-10-10 14:41:49,500 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:49,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash 257238174, now seen corresponding path program 2 times [2018-10-10 14:41:49,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-10 14:41:49,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:49,842 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:41:49,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:41:49,875 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:41:49,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:41:49,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:50,016 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:41:50,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:50,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:41:50,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2018-10-10 14:41:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-10 14:41:50,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:50,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 25 [2018-10-10 14:41:50,491 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:41:50,496 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:41:50,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:41:50 BoogieIcfgContainer [2018-10-10 14:41:50,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:41:50,497 INFO L168 Benchmark]: Toolchain (without parser) took 19480.09 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -930.1 MB). Peak memory consumption was 89.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:50,498 INFO L168 Benchmark]: CDTParser took 0.20 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:41:50,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.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:41:50,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.72 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:41:50,500 INFO L168 Benchmark]: Boogie Preprocessor took 104.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:50,501 INFO L168 Benchmark]: RCFGBuilder took 961.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:50,502 INFO L168 Benchmark]: TraceAbstraction took 17855.46 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 278.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -180.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:50,506 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.20 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 485.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 67.72 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 104.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 961.36 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17855.46 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 278.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -180.2 MB). Peak memory consumption was 98.2 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 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 13 error locations. TIMEOUT Result, 17.7s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1283 SDtfs, 11796 SDslu, 4669 SDs, 0 SdLazy, 2301 SolverSat, 209 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 153 SyntacticMatches, 7 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=8, 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, 11 MinimizatonAttempts, 892 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 866 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 853 ConstructedInterpolants, 2 QuantifiedInterpolants, 482982 SizeOfPredicates, 26 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 27/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...