java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:28,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:28,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:28,236 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:28,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:28,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:28,239 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:28,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:28,243 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:28,244 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:28,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:28,245 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:28,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:28,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:28,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:28,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:28,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:28,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:28,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:28,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:28,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:28,259 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:28,261 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:28,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:28,262 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:28,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:28,264 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:28,265 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:28,266 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:28,267 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:28,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:28,268 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:28,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:28,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:28,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:28,271 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:28,271 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:41:28,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:28,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:28,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:28,289 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:28,289 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:28,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:28,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:28,290 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:28,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:28,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:28,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:28,291 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:28,292 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:28,292 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:28,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:28,293 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:28,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:28,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:28,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:28,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:28,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:28,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:28,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:28,295 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:28,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:28,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:41:28,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:28,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:28,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:28,383 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:28,383 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:28,384 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:28,688 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b0ed9c0/411de0ca0f6b424282fb8521ef67c603/FLAGb7392bcc4 [2018-10-10 14:41:29,006 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:29,007 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/add_last-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:29,023 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b0ed9c0/411de0ca0f6b424282fb8521ef67c603/FLAGb7392bcc4 [2018-10-10 14:41:29,039 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b0ed9c0/411de0ca0f6b424282fb8521ef67c603 [2018-10-10 14:41:29,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:29,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:29,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:29,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:29,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:29,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428e85e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29, skipping insertion in model container [2018-10-10 14:41:29,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:29,115 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:29,350 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:29,360 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:29,410 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:29,493 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:29,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29 WrapperNode [2018-10-10 14:41:29,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:29,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:29,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:29,495 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:29,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:29,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:29,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:29,558 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:29,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... [2018-10-10 14:41:29,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:29,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:29,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:29,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:29,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:29,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:29,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:30,534 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:30,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:30 BoogieIcfgContainer [2018-10-10 14:41:30,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:30,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:30,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:30,540 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:30,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:29" (1/3) ... [2018-10-10 14:41:30,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89cc206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:30, skipping insertion in model container [2018-10-10 14:41:30,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:29" (2/3) ... [2018-10-10 14:41:30,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89cc206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:30, skipping insertion in model container [2018-10-10 14:41:30,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:30" (3/3) ... [2018-10-10 14:41:30,543 INFO L112 eAbstractionObserver]: Analyzing ICFG add_last-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:30,552 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:30,560 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-10-10 14:41:30,578 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-10-10 14:41:30,605 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:30,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:30,606 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:30,607 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:30,607 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:30,608 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:30,608 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:30,608 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:30,608 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-10-10 14:41:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-10 14:41:30,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:30,640 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] [2018-10-10 14:41:30,643 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:30,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1185952337, now seen corresponding path program 1 times [2018-10-10 14:41:30,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:30,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:30,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:30,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:30,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:30,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:41:30,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:41:30,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:41:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:41:30,971 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 7 states. [2018-10-10 14:41:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:32,331 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2018-10-10 14:41:32,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:32,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-10-10 14:41:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:32,346 INFO L225 Difference]: With dead ends: 193 [2018-10-10 14:41:32,346 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 14:41:32,348 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:41:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 14:41:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2018-10-10 14:41:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 14:41:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2018-10-10 14:41:32,398 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 33 [2018-10-10 14:41:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:32,398 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2018-10-10 14:41:32,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:41:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2018-10-10 14:41:32,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-10 14:41:32,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:32,400 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] [2018-10-10 14:41:32,400 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:32,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:32,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1890183129, now seen corresponding path program 1 times [2018-10-10 14:41:32,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:32,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:32,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:32,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:32,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:32,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:41:32,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:41:32,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:41:32,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:32,711 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 10 states. [2018-10-10 14:41:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:33,508 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2018-10-10 14:41:33,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:41:33,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-10 14:41:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:33,518 INFO L225 Difference]: With dead ends: 191 [2018-10-10 14:41:33,519 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 14:41:33,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:41:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 14:41:33,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 145. [2018-10-10 14:41:33,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 14:41:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-10-10 14:41:33,541 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 34 [2018-10-10 14:41:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:33,546 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-10-10 14:41:33,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:41:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-10-10 14:41:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 14:41:33,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:33,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:33,550 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:33,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1701447472, now seen corresponding path program 1 times [2018-10-10 14:41:33,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:33,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:33,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:33,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:33,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:41:33,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:41:33,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:41:33,663 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 5 states. [2018-10-10 14:41:33,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:33,745 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-10-10 14:41:33,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:33,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-10 14:41:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:33,748 INFO L225 Difference]: With dead ends: 137 [2018-10-10 14:41:33,748 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 14:41:33,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 14:41:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-10 14:41:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 14:41:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-10-10 14:41:33,761 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 37 [2018-10-10 14:41:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:33,762 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-10-10 14:41:33,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:41:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-10-10 14:41:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-10 14:41:33,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:33,765 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:33,765 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:33,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1663376595, now seen corresponding path program 1 times [2018-10-10 14:41:33,766 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:33,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:33,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:33,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:34,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:34,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:34,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:34,062 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 9 states. [2018-10-10 14:41:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:34,486 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-10-10 14:41:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:34,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-10-10 14:41:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:34,488 INFO L225 Difference]: With dead ends: 135 [2018-10-10 14:41:34,488 INFO L226 Difference]: Without dead ends: 135 [2018-10-10 14:41:34,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:34,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-10 14:41:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-10 14:41:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 14:41:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-10-10 14:41:34,496 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 44 [2018-10-10 14:41:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:34,496 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-10-10 14:41:34,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-10-10 14:41:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:41:34,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:34,499 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] [2018-10-10 14:41:34,499 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:34,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:34,500 INFO L82 PathProgramCache]: Analyzing trace with hash 898805064, now seen corresponding path program 1 times [2018-10-10 14:41:34,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:34,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:34,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:34,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:34,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:34,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:34,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:34,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:34,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:34,759 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 9 states. [2018-10-10 14:41:35,132 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-10-10 14:41:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:35,353 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-10-10 14:41:35,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:41:35,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-10-10 14:41:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:35,356 INFO L225 Difference]: With dead ends: 134 [2018-10-10 14:41:35,357 INFO L226 Difference]: Without dead ends: 123 [2018-10-10 14:41:35,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:35,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-10 14:41:35,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-10 14:41:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 14:41:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-10-10 14:41:35,364 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 62 [2018-10-10 14:41:35,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:35,365 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-10-10 14:41:35,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-10-10 14:41:35,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:41:35,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:35,367 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:35,368 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:35,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2048156017, now seen corresponding path program 1 times [2018-10-10 14:41:35,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:35,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:35,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:41:35,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:41:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:41:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:41:35,540 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 7 states. [2018-10-10 14:41:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:35,855 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2018-10-10 14:41:35,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:35,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-10-10 14:41:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:35,857 INFO L225 Difference]: With dead ends: 154 [2018-10-10 14:41:35,857 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 14:41:35,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 14:41:35,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2018-10-10 14:41:35,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 14:41:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-10-10 14:41:35,865 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 77 [2018-10-10 14:41:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:35,868 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-10-10 14:41:35,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:41:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-10-10 14:41:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:41:35,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:35,870 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:35,875 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:35,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash -931672767, now seen corresponding path program 1 times [2018-10-10 14:41:35,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:35,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:35,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:35,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:36,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:36,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:41:36,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:41:36,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:41:36,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:36,074 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 10 states. [2018-10-10 14:41:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:36,786 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-10-10 14:41:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:36,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-10-10 14:41:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:36,789 INFO L225 Difference]: With dead ends: 205 [2018-10-10 14:41:36,789 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 14:41:36,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:36,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 14:41:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 144. [2018-10-10 14:41:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 14:41:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-10-10 14:41:36,795 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 78 [2018-10-10 14:41:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:36,796 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-10-10 14:41:36,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:41:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-10-10 14:41:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-10 14:41:36,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:36,798 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:36,799 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:36,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:36,799 INFO L82 PathProgramCache]: Analyzing trace with hash 415642890, now seen corresponding path program 1 times [2018-10-10 14:41:36,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:36,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:41:37,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:37,040 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:41:37,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:37,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:37,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:41:37,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:37,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:37,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:41:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:41:37,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:37,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-10 14:41:37,294 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/add_last-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:41:37,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:37,299 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 8 states. [2018-10-10 14:41:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:37,667 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-10-10 14:41:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:37,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-10-10 14:41:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:37,669 INFO L225 Difference]: With dead ends: 142 [2018-10-10 14:41:37,669 INFO L226 Difference]: Without dead ends: 142 [2018-10-10 14:41:37,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-10 14:41:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-10-10 14:41:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-10 14:41:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-10-10 14:41:37,673 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 92 [2018-10-10 14:41:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:37,674 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-10-10 14:41:37,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-10-10 14:41:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 14:41:37,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:37,676 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:37,676 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:37,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash 27790, now seen corresponding path program 1 times [2018-10-10 14:41:37,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:37,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:38,522 WARN L178 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2018-10-10 14:41:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:38,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:38,921 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:41:38,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:38,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:39,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:41:39,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:39,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:39,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:41:40,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:41:40,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:41:40,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:41:40,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:40,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-10 14:41:40,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:65 [2018-10-10 14:41:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:40,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:40,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2018-10-10 14:41:40,633 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/add_last-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:41:40,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 14:41:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 14:41:40,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 14:41:40,635 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 33 states. [2018-10-10 14:41:41,711 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2018-10-10 14:41:41,950 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-10-10 14:41:42,138 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2018-10-10 14:41:42,761 WARN L178 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2018-10-10 14:41:42,899 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2018-10-10 14:41:43,693 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2018-10-10 14:41:43,875 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 37 [2018-10-10 14:41:44,054 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2018-10-10 14:41:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:44,705 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-10-10 14:41:44,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:41:44,705 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2018-10-10 14:41:44,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:44,706 INFO L225 Difference]: With dead ends: 212 [2018-10-10 14:41:44,707 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 14:41:44,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=606, Invalid=2474, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 14:41:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 14:41:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 180. [2018-10-10 14:41:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 14:41:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-10 14:41:44,714 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 93 [2018-10-10 14:41:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:44,714 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-10 14:41:44,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 14:41:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-10 14:41:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 14:41:44,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:44,716 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:44,717 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:44,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:44,717 INFO L82 PathProgramCache]: Analyzing trace with hash 47968938, now seen corresponding path program 1 times [2018-10-10 14:41:44,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:44,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:44,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:44,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-10 14:41:45,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:45,449 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:41:45,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:45,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:45,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:41:45,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:45,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:45,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:41:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-10 14:41:45,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:45,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-10 14:41:45,753 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/add_last-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:41:45,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:45,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:45,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:45,755 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 8 states. [2018-10-10 14:41:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:46,001 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-10-10 14:41:46,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:41:46,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2018-10-10 14:41:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:46,004 INFO L225 Difference]: With dead ends: 179 [2018-10-10 14:41:46,004 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 14:41:46,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 14:41:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-10 14:41:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-10 14:41:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-10 14:41:46,009 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 136 [2018-10-10 14:41:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:46,009 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-10 14:41:46,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-10 14:41:46,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 14:41:46,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:46,011 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:46,012 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:46,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:46,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1487037224, now seen corresponding path program 1 times [2018-10-10 14:41:46,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:46,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:46,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:46,427 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:41:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:46,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:46,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:41:46,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:46,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:46,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-10-10 14:41:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:47,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:47,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2018-10-10 14:41:47,297 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/add_last-alloca_true-valid-memsafety_true-termination.i_11.bpl [2018-10-10 14:41:47,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:41:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:41:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:47,301 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 17 states. [2018-10-10 14:41:48,464 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:41:48,845 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:41:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:49,983 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-10-10 14:41:49,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:41:49,984 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 137 [2018-10-10 14:41:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:49,986 INFO L225 Difference]: With dead ends: 197 [2018-10-10 14:41:49,986 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 14:41:49,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 14:41:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 14:41:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 178. [2018-10-10 14:41:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 14:41:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-10-10 14:41:49,991 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 137 [2018-10-10 14:41:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:49,992 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-10-10 14:41:49,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:41:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-10-10 14:41:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-10 14:41:49,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:49,994 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:41:49,994 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:49,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1196977095, now seen corresponding path program 2 times [2018-10-10 14:41:49,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:49,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:49,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:49,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:51,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:51,225 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:41:51,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:41:51,282 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:41:51,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:41:51,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:51,390 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 8 treesize of output 7 [2018-10-10 14:41:51,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:51,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:51,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-10 14:41:51,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:41:51,619 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 8 treesize of output 7 [2018-10-10 14:41:51,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:51,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:51,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:51,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-10-10 14:41:52,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-10 14:41:52,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-10-10 14:41:52,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:41:52,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:52,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-10 14:41:52,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-10-10 14:41:52,448 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-10 14:41:52,779 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-10 14:41:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:53,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:53,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2018-10-10 14:41:53,330 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:41:53,335 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:41:53,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:41:53 BoogieIcfgContainer [2018-10-10 14:41:53,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:41:53,336 INFO L168 Benchmark]: Toolchain (without parser) took 24286.39 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -338.5 MB). Peak memory consumption was 664.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:53,337 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:41:53,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:53,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:41:53,339 INFO L168 Benchmark]: Boogie Preprocessor took 36.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:41:53,339 INFO L168 Benchmark]: RCFGBuilder took 940.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:53,340 INFO L168 Benchmark]: TraceAbstraction took 22799.19 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 259.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 432.5 MB). Peak memory consumption was 692.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:53,345 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.21 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 441.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.53 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 36.24 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 940.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 743.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22799.19 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 259.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 432.5 MB). Peak memory consumption was 692.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 540). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 11 error locations. TIMEOUT Result, 22.7s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 997 SDtfs, 6826 SDslu, 3411 SDs, 0 SdLazy, 2650 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 645 GetRequests, 445 SyntacticMatches, 8 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 213 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1266 ConstructedInterpolants, 9 QuantifiedInterpolants, 753994 SizeOfPredicates, 57 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 147/212 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...