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/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:51,029 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:51,031 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:51,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:51,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:51,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:51,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:51,049 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:51,051 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:51,052 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:51,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:51,053 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:51,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:51,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:51,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:51,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:51,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:51,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:51,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:51,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:51,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:51,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:51,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:51,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:51,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:51,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:51,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:51,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:51,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:51,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:51,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:51,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:51,077 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:51,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:51,081 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:51,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:51,082 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:51,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:51,116 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:51,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:51,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:51,119 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:51,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:51,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:51,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:51,120 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:51,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:51,121 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:51,121 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:51,121 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:51,121 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:51,122 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:51,122 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:51,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:51,123 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:51,123 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:51,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:51,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:51,124 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:51,125 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:51,125 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:51,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:51,126 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:51,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:51,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:51,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:51,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:51,228 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:51,229 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:51,535 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26a9a653/e1feb202ac3a4cccaf8fe93b2fa66bc7/FLAGd260bf16b [2018-10-10 14:41:51,834 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:51,835 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:51,852 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26a9a653/e1feb202ac3a4cccaf8fe93b2fa66bc7/FLAGd260bf16b [2018-10-10 14:41:51,874 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c26a9a653/e1feb202ac3a4cccaf8fe93b2fa66bc7 [2018-10-10 14:41:51,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:51,886 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:51,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:51,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:51,891 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:51,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:51" (1/1) ... [2018-10-10 14:41:51,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322d085d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:51, skipping insertion in model container [2018-10-10 14:41:51,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:51" (1/1) ... [2018-10-10 14:41:51,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:51,966 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:52,181 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:52,192 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:52,256 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:52,334 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:52,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:52 WrapperNode [2018-10-10 14:41:52,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:52,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:52,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:52,336 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:52,346 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:52" (1/1) ... [2018-10-10 14:41:52,370 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:52" (1/1) ... [2018-10-10 14:41:52,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:52,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:52,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:52,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:52,423 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:52" (1/1) ... [2018-10-10 14:41:52,424 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:52" (1/1) ... [2018-10-10 14:41:52,436 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:52" (1/1) ... [2018-10-10 14:41:52,436 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:52" (1/1) ... [2018-10-10 14:41:52,452 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:52" (1/1) ... [2018-10-10 14:41:52,464 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:52" (1/1) ... [2018-10-10 14:41:52,468 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:52" (1/1) ... [2018-10-10 14:41:52,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:52,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:52,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:52,474 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:52,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:52" (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:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:53,551 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:53,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:53 BoogieIcfgContainer [2018-10-10 14:41:53,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:53,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:53,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:53,557 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:53,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:51" (1/3) ... [2018-10-10 14:41:53,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2e70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:53, skipping insertion in model container [2018-10-10 14:41:53,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:52" (2/3) ... [2018-10-10 14:41:53,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2e70f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:53, skipping insertion in model container [2018-10-10 14:41:53,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:53" (3/3) ... [2018-10-10 14:41:53,561 INFO L112 eAbstractionObserver]: Analyzing ICFG java_BubbleSort-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:53,571 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:53,580 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-10-10 14:41:53,598 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-10-10 14:41:53,628 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:53,629 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:53,629 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:53,629 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:53,629 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:53,630 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:53,630 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:53,630 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:53,630 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-10-10 14:41:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 14:41:53,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:53,665 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] [2018-10-10 14:41:53,668 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:53,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1872407035, now seen corresponding path program 1 times [2018-10-10 14:41:53,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:53,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:53,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:53,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:53,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:54,049 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:54,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:54,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:54,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:54,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:54,077 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 8 states. [2018-10-10 14:41:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:55,000 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2018-10-10 14:41:55,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:55,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-10-10 14:41:55,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:55,016 INFO L225 Difference]: With dead ends: 153 [2018-10-10 14:41:55,016 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 14:41:55,019 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:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 14:41:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2018-10-10 14:41:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 14:41:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-10-10 14:41:55,068 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 41 [2018-10-10 14:41:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:55,068 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-10-10 14:41:55,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-10-10 14:41:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-10 14:41:55,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:55,070 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:55,071 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:55,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2084923965, now seen corresponding path program 1 times [2018-10-10 14:41:55,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:55,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:55,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:55,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:55,420 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:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:55,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:41:55,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:41:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:41:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:55,424 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 12 states. [2018-10-10 14:41:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:56,811 INFO L93 Difference]: Finished difference Result 262 states and 268 transitions. [2018-10-10 14:41:56,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:41:56,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-10-10 14:41:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:56,815 INFO L225 Difference]: With dead ends: 262 [2018-10-10 14:41:56,815 INFO L226 Difference]: Without dead ends: 262 [2018-10-10 14:41:56,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=216, Invalid=434, Unknown=0, NotChecked=0, Total=650 [2018-10-10 14:41:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-10 14:41:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 161. [2018-10-10 14:41:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 14:41:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 167 transitions. [2018-10-10 14:41:56,831 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 167 transitions. Word has length 42 [2018-10-10 14:41:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:56,832 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 167 transitions. [2018-10-10 14:41:56,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:41:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 167 transitions. [2018-10-10 14:41:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 14:41:56,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:56,834 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:41:56,835 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:56,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1996765991, now seen corresponding path program 1 times [2018-10-10 14:41:56,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:56,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:57,059 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:57,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:57,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:57,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:57,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:57,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:57,061 INFO L87 Difference]: Start difference. First operand 161 states and 167 transitions. Second operand 9 states. [2018-10-10 14:41:57,362 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-10 14:41:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:57,533 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-10-10 14:41:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:41:57,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-10-10 14:41:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:57,536 INFO L225 Difference]: With dead ends: 160 [2018-10-10 14:41:57,536 INFO L226 Difference]: Without dead ends: 150 [2018-10-10 14:41:57,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-10 14:41:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-10 14:41:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 14:41:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-10-10 14:41:57,547 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 45 [2018-10-10 14:41:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:57,548 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-10-10 14:41:57,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-10-10 14:41:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:41:57,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:57,550 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] [2018-10-10 14:41:57,550 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:57,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1250414199, now seen corresponding path program 1 times [2018-10-10 14:41:57,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:57,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:57,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:57,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:57,922 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:57,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:57,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:41:57,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:41:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:41:57,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:41:57,924 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 15 states. [2018-10-10 14:41:58,805 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-10-10 14:41:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:59,660 INFO L93 Difference]: Finished difference Result 275 states and 286 transitions. [2018-10-10 14:41:59,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:41:59,661 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-10-10 14:41:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:59,664 INFO L225 Difference]: With dead ends: 275 [2018-10-10 14:41:59,665 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 14:41:59,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:41:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 14:41:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 255. [2018-10-10 14:41:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 14:41:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 271 transitions. [2018-10-10 14:41:59,684 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 271 transitions. Word has length 52 [2018-10-10 14:41:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:59,685 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 271 transitions. [2018-10-10 14:41:59,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:41:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 271 transitions. [2018-10-10 14:41:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 14:41:59,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:59,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:59,688 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:59,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:59,688 INFO L82 PathProgramCache]: Analyzing trace with hash 250253313, now seen corresponding path program 1 times [2018-10-10 14:41:59,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:59,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:59,759 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:59,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:59,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:41:59,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:41:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:41:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:41:59,761 INFO L87 Difference]: Start difference. First operand 255 states and 271 transitions. Second operand 4 states. [2018-10-10 14:41:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:59,821 INFO L93 Difference]: Finished difference Result 347 states and 364 transitions. [2018-10-10 14:41:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 14:41:59,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-10-10 14:41:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:59,823 INFO L225 Difference]: With dead ends: 347 [2018-10-10 14:41:59,824 INFO L226 Difference]: Without dead ends: 347 [2018-10-10 14:41:59,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:41:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-10 14:41:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 255. [2018-10-10 14:41:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 14:41:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 269 transitions. [2018-10-10 14:41:59,838 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 269 transitions. Word has length 60 [2018-10-10 14:41:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:59,839 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 269 transitions. [2018-10-10 14:41:59,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:41:59,839 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 269 transitions. [2018-10-10 14:41:59,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 14:41:59,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:59,842 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] [2018-10-10 14:41:59,842 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:59,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2125396008, now seen corresponding path program 1 times [2018-10-10 14:41:59,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:59,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:59,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:59,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,152 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:42:00,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:00,152 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:00,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:00,324 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:00,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:00,340 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:00,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:01,184 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:01,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:01,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-10-10 14:42:01,243 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_6.bpl [2018-10-10 14:42:01,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 14:42:01,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 14:42:01,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:42:01,249 INFO L87 Difference]: Start difference. First operand 255 states and 269 transitions. Second operand 28 states. [2018-10-10 14:42:01,937 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-10 14:42:02,164 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-10 14:42:02,817 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2018-10-10 14:42:03,132 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-10-10 14:42:03,317 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-10-10 14:42:03,465 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:42:04,551 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-10-10 14:42:05,190 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:42:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:06,663 INFO L93 Difference]: Finished difference Result 500 states and 512 transitions. [2018-10-10 14:42:06,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 14:42:06,664 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 70 [2018-10-10 14:42:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:06,666 INFO L225 Difference]: With dead ends: 500 [2018-10-10 14:42:06,667 INFO L226 Difference]: Without dead ends: 500 [2018-10-10 14:42:06,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1002, Invalid=2904, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 14:42:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-10 14:42:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 396. [2018-10-10 14:42:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-10 14:42:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 420 transitions. [2018-10-10 14:42:06,682 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 420 transitions. Word has length 70 [2018-10-10 14:42:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:06,683 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 420 transitions. [2018-10-10 14:42:06,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 14:42:06,683 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 420 transitions. [2018-10-10 14:42:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 14:42:06,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:06,686 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] [2018-10-10 14:42:06,687 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:06,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:06,687 INFO L82 PathProgramCache]: Analyzing trace with hash 457007576, now seen corresponding path program 1 times [2018-10-10 14:42:06,688 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:06,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:06,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,395 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:07,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:07,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:07,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:07,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:07,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:07,397 INFO L87 Difference]: Start difference. First operand 396 states and 420 transitions. Second operand 8 states. [2018-10-10 14:42:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:07,604 INFO L93 Difference]: Finished difference Result 625 states and 653 transitions. [2018-10-10 14:42:07,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:07,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-10-10 14:42:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:07,611 INFO L225 Difference]: With dead ends: 625 [2018-10-10 14:42:07,612 INFO L226 Difference]: Without dead ends: 625 [2018-10-10 14:42:07,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:07,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-10-10 14:42:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 394. [2018-10-10 14:42:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-10-10 14:42:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 412 transitions. [2018-10-10 14:42:07,625 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 412 transitions. Word has length 87 [2018-10-10 14:42:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:07,625 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 412 transitions. [2018-10-10 14:42:07,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:07,626 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 412 transitions. [2018-10-10 14:42:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 14:42:07,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:07,628 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:42:07,628 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:07,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:07,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1282333118, now seen corresponding path program 1 times [2018-10-10 14:42:07,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:07,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:07,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:07,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,802 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:07,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:42:07,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:07,804 INFO L87 Difference]: Start difference. First operand 394 states and 412 transitions. Second operand 7 states. [2018-10-10 14:42:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,192 INFO L93 Difference]: Finished difference Result 393 states and 408 transitions. [2018-10-10 14:42:08,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:08,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2018-10-10 14:42:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,195 INFO L225 Difference]: With dead ends: 393 [2018-10-10 14:42:08,195 INFO L226 Difference]: Without dead ends: 393 [2018-10-10 14:42:08,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:08,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-10 14:42:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-10-10 14:42:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-10 14:42:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 408 transitions. [2018-10-10 14:42:08,205 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 408 transitions. Word has length 88 [2018-10-10 14:42:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,206 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 408 transitions. [2018-10-10 14:42:08,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 408 transitions. [2018-10-10 14:42:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:42:08,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,208 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] [2018-10-10 14:42:08,209 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1589855617, now seen corresponding path program 1 times [2018-10-10 14:42:08,209 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,454 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:08,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:08,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:42:08,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:08,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:08,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:08,455 INFO L87 Difference]: Start difference. First operand 393 states and 408 transitions. Second operand 7 states. [2018-10-10 14:42:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,864 INFO L93 Difference]: Finished difference Result 623 states and 645 transitions. [2018-10-10 14:42:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:42:08,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-10-10 14:42:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,868 INFO L225 Difference]: With dead ends: 623 [2018-10-10 14:42:08,868 INFO L226 Difference]: Without dead ends: 623 [2018-10-10 14:42:08,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:08,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2018-10-10 14:42:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 392. [2018-10-10 14:42:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-10 14:42:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 404 transitions. [2018-10-10 14:42:08,879 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 404 transitions. Word has length 99 [2018-10-10 14:42:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,879 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 404 transitions. [2018-10-10 14:42:08,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 404 transitions. [2018-10-10 14:42:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 14:42:08,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,884 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash 987454763, now seen corresponding path program 1 times [2018-10-10 14:42:08,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:42:09,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:09,797 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:09,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-10 14:42:10,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:10,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 24 [2018-10-10 14:42:10,290 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/java_BubbleSort-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:42:10,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 14:42:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 14:42:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:42:10,297 INFO L87 Difference]: Start difference. First operand 392 states and 404 transitions. Second operand 24 states. [2018-10-10 14:42:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:13,635 INFO L93 Difference]: Finished difference Result 744 states and 759 transitions. [2018-10-10 14:42:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 14:42:13,637 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 116 [2018-10-10 14:42:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:13,642 INFO L225 Difference]: With dead ends: 744 [2018-10-10 14:42:13,642 INFO L226 Difference]: Without dead ends: 732 [2018-10-10 14:42:13,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=806, Invalid=2854, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 14:42:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-10-10 14:42:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 490. [2018-10-10 14:42:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-10 14:42:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 503 transitions. [2018-10-10 14:42:13,654 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 503 transitions. Word has length 116 [2018-10-10 14:42:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:13,655 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 503 transitions. [2018-10-10 14:42:13,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 14:42:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 503 transitions. [2018-10-10 14:42:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 14:42:13,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,657 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2136564693, now seen corresponding path program 2 times [2018-10-10 14:42:13,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-10 14:42:14,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:14,052 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:14,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:14,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:14,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:14,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:14,141 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:14,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,225 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:14,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 16 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:14,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:14,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-10-10 14:42:14,814 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:14,818 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:14,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:14 BoogieIcfgContainer [2018-10-10 14:42:14,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:14,819 INFO L168 Benchmark]: Toolchain (without parser) took 22934.73 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 1.8 GB in the end (delta: -400.5 MB). Peak memory consumption was 643.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:14,820 INFO L168 Benchmark]: CDTParser took 0.22 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:42:14,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.95 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:14,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.18 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:42:14,822 INFO L168 Benchmark]: Boogie Preprocessor took 62.81 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:42:14,823 INFO L168 Benchmark]: RCFGBuilder took 1078.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 782.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:14,824 INFO L168 Benchmark]: TraceAbstraction took 21265.22 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 261.1 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 399.4 MB). Peak memory consumption was 660.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:14,829 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.22 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 447.95 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.18 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 62.81 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 1078.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 782.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -823.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21265.22 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 261.1 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 399.4 MB). Peak memory consumption was 660.5 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 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 13 error locations. TIMEOUT Result, 21.2s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1246 SDtfs, 16185 SDslu, 4886 SDs, 0 SdLazy, 3101 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=490occurred in iteration=10, 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, 10 MinimizatonAttempts, 1037 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 874 ConstructedInterpolants, 43 QuantifiedInterpolants, 552224 SizeOfPredicates, 26 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 76/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...