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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:52:04,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:52:04,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:52:04,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:52:04,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:52:04,077 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:52:04,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:52:04,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:52:04,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:52:04,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:52:04,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:52:04,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:52:04,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:52:04,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:52:04,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:52:04,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:52:04,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:52:04,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:52:04,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:52:04,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:52:04,114 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:52:04,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:52:04,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:52:04,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:52:04,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:52:04,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:52:04,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:52:04,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:52:04,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:52:04,130 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:52:04,130 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:52:04,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:52:04,131 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:52:04,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:52:04,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:52:04,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:52:04,134 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:52:04,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:52:04,154 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:52:04,155 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:52:04,156 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:52:04,156 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:52:04,156 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:52:04,156 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:52:04,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:52:04,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:52:04,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:52:04,157 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:52:04,157 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:52:04,157 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:52:04,158 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:52:04,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:52:04,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:52:04,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:52:04,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:52:04,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:52:04,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:52:04,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:52:04,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:52:04,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:52:04,160 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:52:04,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:52:04,160 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:52:04,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:52:04,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:52:04,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:52:04,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:52:04,227 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:52:04,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-10-10 14:52:04,545 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88a7e1ff/d47d48b293f3454898dfeb4ea5bc5a81/FLAGa326ae31d [2018-10-10 14:52:04,802 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:52:04,802 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-10-10 14:52:04,819 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88a7e1ff/d47d48b293f3454898dfeb4ea5bc5a81/FLAGa326ae31d [2018-10-10 14:52:04,849 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88a7e1ff/d47d48b293f3454898dfeb4ea5bc5a81 [2018-10-10 14:52:04,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:52:04,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:52:04,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:04,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:52:04,871 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:52:04,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:04" (1/1) ... [2018-10-10 14:52:04,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce96ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:04, skipping insertion in model container [2018-10-10 14:52:04,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:04" (1/1) ... [2018-10-10 14:52:04,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:52:04,941 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:52:05,176 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:05,186 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:52:05,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:05,354 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:52:05,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05 WrapperNode [2018-10-10 14:52:05,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:05,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:05,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:52:05,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:52:05,366 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:52:05" (1/1) ... [2018-10-10 14:52:05,391 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:52:05" (1/1) ... [2018-10-10 14:52:05,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:05,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:52:05,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:52:05,423 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:52:05,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (1/1) ... [2018-10-10 14:52:05,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (1/1) ... [2018-10-10 14:52:05,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (1/1) ... [2018-10-10 14:52:05,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (1/1) ... [2018-10-10 14:52:05,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (1/1) ... [2018-10-10 14:52:05,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (1/1) ... [2018-10-10 14:52:05,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (1/1) ... [2018-10-10 14:52:05,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:52:05,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:52:05,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:52:05,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:52:05,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (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:52:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:52:05,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:52:06,608 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:52:06,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:06 BoogieIcfgContainer [2018-10-10 14:52:06,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:52:06,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:52:06,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:52:06,615 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:52:06,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:52:04" (1/3) ... [2018-10-10 14:52:06,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ad51c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:06, skipping insertion in model container [2018-10-10 14:52:06,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:05" (2/3) ... [2018-10-10 14:52:06,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ad51c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:06, skipping insertion in model container [2018-10-10 14:52:06,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:06" (3/3) ... [2018-10-10 14:52:06,618 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-10-10 14:52:06,629 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:52:06,637 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-10-10 14:52:06,654 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-10-10 14:52:06,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:52:06,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:52:06,684 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:52:06,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:52:06,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:52:06,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:52:06,685 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:52:06,685 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:52:06,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:52:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states. [2018-10-10 14:52:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 14:52:06,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:06,719 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:52:06,722 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:06,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:06,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1796650535, now seen corresponding path program 1 times [2018-10-10 14:52:06,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:06,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:06,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:06,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:06,872 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:52:06,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:06,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:52:06,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:52:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:52:06,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:52:06,902 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 2 states. [2018-10-10 14:52:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:06,930 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-10-10 14:52:06,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:52:06,931 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 45 [2018-10-10 14:52:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:06,945 INFO L225 Difference]: With dead ends: 178 [2018-10-10 14:52:06,945 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 14:52:06,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:52:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 14:52:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-10 14:52:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-10 14:52:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 176 transitions. [2018-10-10 14:52:06,999 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 176 transitions. Word has length 45 [2018-10-10 14:52:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:06,999 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 176 transitions. [2018-10-10 14:52:06,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:52:07,000 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 176 transitions. [2018-10-10 14:52:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 14:52:07,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:07,001 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] [2018-10-10 14:52:07,002 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:07,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:07,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1991908454, now seen corresponding path program 1 times [2018-10-10 14:52:07,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:07,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:07,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:07,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:07,203 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:52:07,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:07,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:07,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:07,207 INFO L87 Difference]: Start difference. First operand 173 states and 176 transitions. Second operand 7 states. [2018-10-10 14:52:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:08,296 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-10 14:52:08,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:52:08,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-10-10 14:52:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:08,307 INFO L225 Difference]: With dead ends: 171 [2018-10-10 14:52:08,308 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 14:52:08,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 14:52:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-10 14:52:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 14:52:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2018-10-10 14:52:08,324 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 48 [2018-10-10 14:52:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:08,325 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2018-10-10 14:52:08,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2018-10-10 14:52:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 14:52:08,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:08,327 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] [2018-10-10 14:52:08,328 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:08,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1619619834, now seen corresponding path program 1 times [2018-10-10 14:52:08,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:08,598 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:52:08,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:08,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:52:08,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:52:08,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:52:08,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:52:08,600 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand 10 states. [2018-10-10 14:52:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:09,543 INFO L93 Difference]: Finished difference Result 412 states and 420 transitions. [2018-10-10 14:52:09,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:52:09,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-10-10 14:52:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:09,549 INFO L225 Difference]: With dead ends: 412 [2018-10-10 14:52:09,549 INFO L226 Difference]: Without dead ends: 412 [2018-10-10 14:52:09,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:52:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-10 14:52:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 208. [2018-10-10 14:52:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-10 14:52:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 212 transitions. [2018-10-10 14:52:09,568 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 212 transitions. Word has length 49 [2018-10-10 14:52:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:09,568 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 212 transitions. [2018-10-10 14:52:09,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:52:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-10-10 14:52:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:52:09,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:09,571 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:09,572 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:09,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:09,572 INFO L82 PathProgramCache]: Analyzing trace with hash 636882012, now seen corresponding path program 1 times [2018-10-10 14:52:09,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:09,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:09,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:09,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:09,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:09,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:09,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:09,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:52:09,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:52:09,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:52:09,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:09,819 INFO L87 Difference]: Start difference. First operand 208 states and 212 transitions. Second operand 12 states. [2018-10-10 14:52:11,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:11,220 INFO L93 Difference]: Finished difference Result 411 states and 419 transitions. [2018-10-10 14:52:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:52:11,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-10-10 14:52:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:11,230 INFO L225 Difference]: With dead ends: 411 [2018-10-10 14:52:11,230 INFO L226 Difference]: Without dead ends: 411 [2018-10-10 14:52:11,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:52:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-10 14:52:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 170. [2018-10-10 14:52:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-10 14:52:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 173 transitions. [2018-10-10 14:52:11,248 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 173 transitions. Word has length 56 [2018-10-10 14:52:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:11,248 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 173 transitions. [2018-10-10 14:52:11,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:52:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 173 transitions. [2018-10-10 14:52:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 14:52:11,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:11,253 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] [2018-10-10 14:52:11,254 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:11,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:11,254 INFO L82 PathProgramCache]: Analyzing trace with hash -318231245, now seen corresponding path program 1 times [2018-10-10 14:52:11,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:11,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:11,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:11,456 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:52:11,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:11,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:52:11,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:52:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:52:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:11,459 INFO L87 Difference]: Start difference. First operand 170 states and 173 transitions. Second operand 8 states. [2018-10-10 14:52:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:11,800 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-10-10 14:52:11,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:52:11,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-10-10 14:52:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:11,803 INFO L225 Difference]: With dead ends: 167 [2018-10-10 14:52:11,803 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 14:52:11,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:52:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 14:52:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-10 14:52:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-10 14:52:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2018-10-10 14:52:11,811 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 65 [2018-10-10 14:52:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:11,811 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2018-10-10 14:52:11,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:52:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2018-10-10 14:52:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-10 14:52:11,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:11,813 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] [2018-10-10 14:52:11,814 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:11,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1275233881, now seen corresponding path program 1 times [2018-10-10 14:52:11,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:11,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:12,254 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:52:12,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:12,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:52:12,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:52:12,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:52:12,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:52:12,256 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 14 states. [2018-10-10 14:52:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:13,981 INFO L93 Difference]: Finished difference Result 417 states and 424 transitions. [2018-10-10 14:52:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:52:13,981 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2018-10-10 14:52:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:13,984 INFO L225 Difference]: With dead ends: 417 [2018-10-10 14:52:13,984 INFO L226 Difference]: Without dead ends: 417 [2018-10-10 14:52:13,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-10-10 14:52:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-10 14:52:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 280. [2018-10-10 14:52:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-10 14:52:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 293 transitions. [2018-10-10 14:52:13,995 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 293 transitions. Word has length 66 [2018-10-10 14:52:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:13,995 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 293 transitions. [2018-10-10 14:52:13,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:52:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 293 transitions. [2018-10-10 14:52:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:52:13,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:13,998 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:13,999 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:13,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash -840469487, now seen corresponding path program 1 times [2018-10-10 14:52:14,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:14,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:14,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:14,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:14,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:52:14,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:52:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:52:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:52:14,376 INFO L87 Difference]: Start difference. First operand 280 states and 293 transitions. Second operand 16 states. [2018-10-10 14:52:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:15,858 INFO L93 Difference]: Finished difference Result 365 states and 372 transitions. [2018-10-10 14:52:15,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 14:52:15,859 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 73 [2018-10-10 14:52:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:15,862 INFO L225 Difference]: With dead ends: 365 [2018-10-10 14:52:15,863 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 14:52:15,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=280, Invalid=910, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:52:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 14:52:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 244. [2018-10-10 14:52:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-10 14:52:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 250 transitions. [2018-10-10 14:52:15,870 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 250 transitions. Word has length 73 [2018-10-10 14:52:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:15,871 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 250 transitions. [2018-10-10 14:52:15,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:52:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 250 transitions. [2018-10-10 14:52:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 14:52:15,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:15,875 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,876 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:15,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash 216126374, now seen corresponding path program 1 times [2018-10-10 14:52:15,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:15,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:15,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:15,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:15,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:15,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:52:15,996 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:52:16,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:16,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:52:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:16,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:52:16,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-10-10 14:52:16,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:16,217 INFO L87 Difference]: Start difference. First operand 244 states and 250 transitions. Second operand 9 states. [2018-10-10 14:52:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:16,389 INFO L93 Difference]: Finished difference Result 313 states and 317 transitions. [2018-10-10 14:52:16,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:52:16,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-10-10 14:52:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:16,393 INFO L225 Difference]: With dead ends: 313 [2018-10-10 14:52:16,394 INFO L226 Difference]: Without dead ends: 313 [2018-10-10 14:52:16,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:52:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-10 14:52:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 241. [2018-10-10 14:52:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-10 14:52:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 245 transitions. [2018-10-10 14:52:16,401 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 245 transitions. Word has length 81 [2018-10-10 14:52:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:16,401 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 245 transitions. [2018-10-10 14:52:16,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 245 transitions. [2018-10-10 14:52:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 14:52:16,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:16,403 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:16,403 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:16,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1610541442, now seen corresponding path program 1 times [2018-10-10 14:52:16,404 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:16,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:16,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:16,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:16,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:16,514 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:52:16,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:16,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:16,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:16,515 INFO L87 Difference]: Start difference. First operand 241 states and 245 transitions. Second operand 7 states. [2018-10-10 14:52:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:16,960 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2018-10-10 14:52:16,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:52:16,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-10-10 14:52:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:16,962 INFO L225 Difference]: With dead ends: 239 [2018-10-10 14:52:16,962 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 14:52:16,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:52:16,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 14:52:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-10 14:52:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-10 14:52:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 243 transitions. [2018-10-10 14:52:16,969 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 243 transitions. Word has length 83 [2018-10-10 14:52:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:16,970 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 243 transitions. [2018-10-10 14:52:16,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 243 transitions. [2018-10-10 14:52:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:52:16,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:16,972 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:16,973 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:16,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:16,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1612823020, now seen corresponding path program 1 times [2018-10-10 14:52:16,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:16,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:16,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:17,351 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:52:17,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:17,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:52:17,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:52:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:52:17,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:17,353 INFO L87 Difference]: Start difference. First operand 239 states and 243 transitions. Second operand 12 states. [2018-10-10 14:52:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:18,139 INFO L93 Difference]: Finished difference Result 300 states and 303 transitions. [2018-10-10 14:52:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:52:18,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 84 [2018-10-10 14:52:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:18,142 INFO L225 Difference]: With dead ends: 300 [2018-10-10 14:52:18,142 INFO L226 Difference]: Without dead ends: 300 [2018-10-10 14:52:18,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:52:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-10 14:52:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 272. [2018-10-10 14:52:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-10 14:52:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 278 transitions. [2018-10-10 14:52:18,150 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 278 transitions. Word has length 84 [2018-10-10 14:52:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:18,151 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 278 transitions. [2018-10-10 14:52:18,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:52:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 278 transitions. [2018-10-10 14:52:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 14:52:18,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:18,152 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:18,153 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:18,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1662355460, now seen corresponding path program 1 times [2018-10-10 14:52:18,153 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:18,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:18,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:18,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:18,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:52:18,730 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:52:18,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:18,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:52:18,934 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:52:18,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:19,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:19,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:52:19,025 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:52:19,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:19,138 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:52:19,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:52:19,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:19,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:52:19,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:52:19,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:19,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:19,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:52:19,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:52:19,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:19,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:19,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:52:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:19,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:52:19,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 20 [2018-10-10 14:52:19,750 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/960521-1_1_true-valid-memsafety.i_11.bpl [2018-10-10 14:52:19,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:52:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:52:19,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:52:19,755 INFO L87 Difference]: Start difference. First operand 272 states and 278 transitions. Second operand 21 states. [2018-10-10 14:52:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:21,971 INFO L93 Difference]: Finished difference Result 347 states and 351 transitions. [2018-10-10 14:52:21,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:52:21,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-10-10 14:52:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:21,974 INFO L225 Difference]: With dead ends: 347 [2018-10-10 14:52:21,975 INFO L226 Difference]: Without dead ends: 347 [2018-10-10 14:52:21,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=514, Invalid=1742, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:52:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-10 14:52:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 287. [2018-10-10 14:52:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-10 14:52:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 293 transitions. [2018-10-10 14:52:21,982 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 293 transitions. Word has length 88 [2018-10-10 14:52:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:21,983 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 293 transitions. [2018-10-10 14:52:21,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:52:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 293 transitions. [2018-10-10 14:52:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:52:21,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:21,984 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:21,985 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:21,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:21,985 INFO L82 PathProgramCache]: Analyzing trace with hash 439838194, now seen corresponding path program 1 times [2018-10-10 14:52:21,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:21,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:21,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:21,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:22,236 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:52:22,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:22,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:52:22,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:52:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:52:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:22,238 INFO L87 Difference]: Start difference. First operand 287 states and 293 transitions. Second operand 12 states. [2018-10-10 14:52:22,770 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-10 14:52:23,478 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 14:52:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:23,770 INFO L93 Difference]: Finished difference Result 314 states and 317 transitions. [2018-10-10 14:52:23,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:52:23,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-10-10 14:52:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:23,772 INFO L225 Difference]: With dead ends: 314 [2018-10-10 14:52:23,773 INFO L226 Difference]: Without dead ends: 314 [2018-10-10 14:52:23,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:52:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-10 14:52:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 287. [2018-10-10 14:52:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-10 14:52:23,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 292 transitions. [2018-10-10 14:52:23,779 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 292 transitions. Word has length 94 [2018-10-10 14:52:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:23,779 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 292 transitions. [2018-10-10 14:52:23,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:52:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 292 transitions. [2018-10-10 14:52:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 14:52:23,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:23,780 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:23,781 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:23,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:23,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1309130929, now seen corresponding path program 2 times [2018-10-10 14:52:23,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:23,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:23,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:23,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:23,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:24,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:52:24,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:52:24,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:52:24,920 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:52:24,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:52:24,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:52:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:25,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:52:25,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-10-10 14:52:25,572 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:52:25,577 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:52:25,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:52:25 BoogieIcfgContainer [2018-10-10 14:52:25,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:52:25,579 INFO L168 Benchmark]: Toolchain (without parser) took 20716.75 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.2 GB in the end (delta: -815.9 MB). Peak memory consumption was 202.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:25,580 INFO L168 Benchmark]: CDTParser took 0.19 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:52:25,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.59 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:52:25,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.45 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:52:25,581 INFO L168 Benchmark]: Boogie Preprocessor took 59.23 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:52:25,582 INFO L168 Benchmark]: RCFGBuilder took 1126.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:25,583 INFO L168 Benchmark]: TraceAbstraction took 18966.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 278.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -70.1 MB). Peak memory consumption was 208.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:25,587 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.19 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 488.59 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 66.45 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 59.23 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 1126.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18966.74 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 278.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -70.1 MB). Peak memory consumption was 208.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 178 locations, 19 error locations. TIMEOUT Result, 18.9s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2065 SDtfs, 9896 SDslu, 10905 SDs, 0 SdLazy, 5108 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=11, 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, 12 MinimizatonAttempts, 890 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1001 NumberOfCodeBlocks, 1001 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 461155 SizeOfPredicates, 26 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 30/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...