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/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:33,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:33,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:33,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:33,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:33,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:33,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:33,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:33,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:33,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:33,278 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:33,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:33,279 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:33,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:33,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:33,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:33,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:33,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:33,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:33,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:33,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:33,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:33,293 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:33,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:33,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:33,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:33,295 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:33,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:33,297 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:33,298 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:33,298 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:33,299 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:33,299 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:33,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:33,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:33,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:33,301 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:33,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:33,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:33,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:33,318 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:33,318 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:33,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:33,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:33,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:33,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:33,319 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:33,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:33,319 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:33,319 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:33,319 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:33,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:33,320 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:33,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:33,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:33,320 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:33,321 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:33,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:33,321 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:33,321 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:33,321 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:33,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:33,322 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:33,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:33,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:33,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:33,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:33,399 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:33,400 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:33,724 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c27ce01/2dbb9299b9254bada7ff57a23466475e/FLAG30638fead [2018-10-10 14:41:34,008 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:34,009 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:34,022 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c27ce01/2dbb9299b9254bada7ff57a23466475e/FLAG30638fead [2018-10-10 14:41:34,037 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c27ce01/2dbb9299b9254bada7ff57a23466475e [2018-10-10 14:41:34,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:34,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:34,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:34,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:34,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:34,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:34" (1/1) ... [2018-10-10 14:41:34,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722534df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:34, skipping insertion in model container [2018-10-10 14:41:34,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:34" (1/1) ... [2018-10-10 14:41:34,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:34,113 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:34,335 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:34,346 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:34,407 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:34,493 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:34,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:34 WrapperNode [2018-10-10 14:41:34,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:34,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:34,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:34,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:34,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:34" (1/1) ... [2018-10-10 14:41:34,532 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:34" (1/1) ... [2018-10-10 14:41:34,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:34,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:34,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:34,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:34,586 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:34" (1/1) ... [2018-10-10 14:41:34,587 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:34" (1/1) ... [2018-10-10 14:41:34,591 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:34" (1/1) ... [2018-10-10 14:41:34,594 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:34" (1/1) ... [2018-10-10 14:41:34,608 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:34" (1/1) ... [2018-10-10 14:41:34,619 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:34" (1/1) ... [2018-10-10 14:41:34,621 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:34" (1/1) ... [2018-10-10 14:41:34,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:34,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:34,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:34,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:34,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:34" (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:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:34,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:35,652 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:35,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:35 BoogieIcfgContainer [2018-10-10 14:41:35,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:35,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:35,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:35,661 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:35,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:34" (1/3) ... [2018-10-10 14:41:35,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b380da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:35, skipping insertion in model container [2018-10-10 14:41:35,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:34" (2/3) ... [2018-10-10 14:41:35,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b380da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:35, skipping insertion in model container [2018-10-10 14:41:35,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:35" (3/3) ... [2018-10-10 14:41:35,665 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:35,675 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:35,686 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-10-10 14:41:35,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-10-10 14:41:35,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:35,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:35,741 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:35,741 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:35,742 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:35,743 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:35,743 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:35,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:35,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states. [2018-10-10 14:41:35,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-10 14:41:35,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:35,778 INFO L375 BasicCegarLoop]: trace histogram [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,780 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:35,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1888490724, now seen corresponding path program 1 times [2018-10-10 14:41:35,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:35,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:35,949 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,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:35,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:41:35,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:41:35,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:41:35,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:35,979 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 3 states. [2018-10-10 14:41:36,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:36,115 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-10 14:41:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:41:36,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-10 14:41:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:36,130 INFO L225 Difference]: With dead ends: 129 [2018-10-10 14:41:36,130 INFO L226 Difference]: Without dead ends: 122 [2018-10-10 14:41:36,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-10 14:41:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-10-10 14:41:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 14:41:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-10-10 14:41:36,177 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 19 [2018-10-10 14:41:36,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:36,178 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-10-10 14:41:36,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:41:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-10-10 14:41:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:41:36,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:36,180 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] [2018-10-10 14:41:36,180 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:36,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:36,181 INFO L82 PathProgramCache]: Analyzing trace with hash 260442721, now seen corresponding path program 1 times [2018-10-10 14:41:36,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:36,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:36,371 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,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:36,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:36,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:36,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:36,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:36,374 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 6 states. [2018-10-10 14:41:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:36,774 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-10-10 14:41:36,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:36,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-10-10 14:41:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:36,779 INFO L225 Difference]: With dead ends: 121 [2018-10-10 14:41:36,779 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 14:41:36,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 14:41:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-10-10 14:41:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 14:41:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-10-10 14:41:36,791 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 47 [2018-10-10 14:41:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:36,792 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-10-10 14:41:36,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-10-10 14:41:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 14:41:36,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:36,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:36,794 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:36,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash -516210144, now seen corresponding path program 1 times [2018-10-10 14:41:36,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:36,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:36,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:36,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:37,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:37,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:37,420 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 9 states. [2018-10-10 14:41:38,141 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 14:41:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:38,144 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-10-10 14:41:38,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:38,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-10 14:41:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:38,149 INFO L225 Difference]: With dead ends: 140 [2018-10-10 14:41:38,149 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 14:41:38,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 14:41:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2018-10-10 14:41:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 14:41:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-10-10 14:41:38,169 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 48 [2018-10-10 14:41:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:38,173 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-10-10 14:41:38,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-10-10 14:41:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-10 14:41:38,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:38,178 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] [2018-10-10 14:41:38,178 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:38,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:38,179 INFO L82 PathProgramCache]: Analyzing trace with hash -321725906, now seen corresponding path program 1 times [2018-10-10 14:41:38,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:38,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:38,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:38,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:38,451 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:38,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:38,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:41:38,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:41:38,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:41:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:38,453 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 10 states. [2018-10-10 14:41:39,119 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:41:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:39,367 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-10-10 14:41:39,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:41:39,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-10-10 14:41:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:39,371 INFO L225 Difference]: With dead ends: 126 [2018-10-10 14:41:39,371 INFO L226 Difference]: Without dead ends: 126 [2018-10-10 14:41:39,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:41:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-10 14:41:39,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-10-10 14:41:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 14:41:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-10-10 14:41:39,379 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 69 [2018-10-10 14:41:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:39,380 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-10-10 14:41:39,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:41:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-10-10 14:41:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 14:41:39,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:39,382 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:39,382 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:39,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1383568369, now seen corresponding path program 1 times [2018-10-10 14:41:39,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:39,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:39,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:39,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:39,679 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:39,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:39,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:41:39,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:41:39,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:41:39,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:39,681 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 13 states. [2018-10-10 14:41:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:40,607 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2018-10-10 14:41:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:41:40,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2018-10-10 14:41:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:40,610 INFO L225 Difference]: With dead ends: 181 [2018-10-10 14:41:40,610 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 14:41:40,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:41:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 14:41:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 128. [2018-10-10 14:41:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 14:41:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-10-10 14:41:40,620 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 70 [2018-10-10 14:41:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:40,621 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-10-10 14:41:40,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:41:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-10-10 14:41:40,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 14:41:40,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:40,623 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:40,623 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash -531301355, now seen corresponding path program 1 times [2018-10-10 14:41:40,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:40,909 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:40,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:40,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:41:40,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:41:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:41:40,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:40,911 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 12 states. [2018-10-10 14:41:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:41,767 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-10 14:41:41,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:41:41,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-10-10 14:41:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:41,771 INFO L225 Difference]: With dead ends: 127 [2018-10-10 14:41:41,771 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 14:41:41,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:41:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 14:41:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-10 14:41:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 14:41:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-10-10 14:41:41,779 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 80 [2018-10-10 14:41:41,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:41,780 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-10-10 14:41:41,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:41:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-10-10 14:41:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 14:41:41,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:41,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:41,782 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:41,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash 709527317, now seen corresponding path program 1 times [2018-10-10 14:41:41,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:41,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:41,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:42,124 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:42,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:42,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:41:42,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:41:42,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:41:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:42,126 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 17 states. [2018-10-10 14:41:42,585 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-10 14:41:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:43,599 INFO L93 Difference]: Finished difference Result 190 states and 192 transitions. [2018-10-10 14:41:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:41:43,605 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2018-10-10 14:41:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:43,607 INFO L225 Difference]: With dead ends: 190 [2018-10-10 14:41:43,607 INFO L226 Difference]: Without dead ends: 190 [2018-10-10 14:41:43,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:41:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-10 14:41:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 138. [2018-10-10 14:41:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 14:41:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-10-10 14:41:43,614 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 81 [2018-10-10 14:41:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:43,615 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-10-10 14:41:43,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:41:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-10-10 14:41:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:41:43,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:43,617 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:43,618 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:43,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:43,618 INFO L82 PathProgramCache]: Analyzing trace with hash 64464893, now seen corresponding path program 1 times [2018-10-10 14:41:43,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:43,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:43,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:43,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:44,211 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-10 14:41:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:44,757 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:44,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:44,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:44,898 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:44,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:45,002 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:45,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:41:45,313 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:45,315 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:45,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:45,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:45,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:41:45,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:41:45,981 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:46,025 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:46,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:41:46,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:46,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:46,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:41:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:46,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:46,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2018-10-10 14:41:46,706 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/cstrcpy-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:41:46,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 14:41:46,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 14:41:46,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1096, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:41:46,721 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 35 states. [2018-10-10 14:41:48,365 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2018-10-10 14:41:48,903 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-10-10 14:41:49,327 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 84 [2018-10-10 14:41:49,646 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-10-10 14:41:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:50,760 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-10-10 14:41:50,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:41:50,761 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 99 [2018-10-10 14:41:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:50,763 INFO L225 Difference]: With dead ends: 232 [2018-10-10 14:41:50,763 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 14:41:50,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=593, Invalid=2947, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 14:41:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 14:41:50,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 156. [2018-10-10 14:41:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 14:41:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2018-10-10 14:41:50,772 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 99 [2018-10-10 14:41:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:50,772 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2018-10-10 14:41:50,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 14:41:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2018-10-10 14:41:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 14:41:50,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:50,775 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:50,775 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:50,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash -112840697, now seen corresponding path program 1 times [2018-10-10 14:41:50,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:50,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:50,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:50,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:51,455 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:41:51,969 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:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:51,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:41:51,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:41:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:41:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:51,971 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand 16 states. [2018-10-10 14:41:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:52,916 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2018-10-10 14:41:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:41:52,917 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 110 [2018-10-10 14:41:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:52,918 INFO L225 Difference]: With dead ends: 155 [2018-10-10 14:41:52,918 INFO L226 Difference]: Without dead ends: 132 [2018-10-10 14:41:52,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:41:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-10 14:41:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-10-10 14:41:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 14:41:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-10-10 14:41:52,923 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 110 [2018-10-10 14:41:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:52,923 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-10-10 14:41:52,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:41:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-10-10 14:41:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 14:41:52,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:52,925 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:52,926 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:52,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:52,926 INFO L82 PathProgramCache]: Analyzing trace with hash 887106151, now seen corresponding path program 1 times [2018-10-10 14:41:52,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:52,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:53,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:53,991 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:54,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:54,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:54,081 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:54,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:54,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:54,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:41:54,132 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:54,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:54,176 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:54,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:41:54,248 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:41:54,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:41:54,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:41:54,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:54,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:54,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:41:54,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:41:54,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:54,370 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:54,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-10-10 14:41:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:55,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:55,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 51 [2018-10-10 14:41:55,635 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/cstrcpy-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:41:55,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 14:41:55,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 14:41:55,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=2533, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 14:41:55,637 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 52 states. [2018-10-10 14:41:57,603 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-10 14:41:57,941 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-10-10 14:41:58,209 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-10-10 14:41:58,490 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-10-10 14:41:58,966 WARN L178 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2018-10-10 14:41:59,303 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2018-10-10 14:41:59,775 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2018-10-10 14:42:00,134 WARN L178 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2018-10-10 14:42:00,478 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2018-10-10 14:42:00,840 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-10-10 14:42:01,345 WARN L178 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2018-10-10 14:42:01,760 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 86 [2018-10-10 14:42:02,050 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-10-10 14:42:02,368 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-10-10 14:42:02,665 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-10-10 14:42:02,981 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2018-10-10 14:42:03,383 WARN L178 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-10-10 14:42:03,864 WARN L178 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 100 [2018-10-10 14:42:04,465 WARN L178 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2018-10-10 14:42:05,028 WARN L178 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2018-10-10 14:42:05,327 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-10-10 14:42:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:05,572 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-10-10 14:42:05,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 14:42:05,573 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 110 [2018-10-10 14:42:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:05,575 INFO L225 Difference]: With dead ends: 171 [2018-10-10 14:42:05,575 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 14:42:05,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1209, Invalid=6447, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 14:42:05,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 14:42:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2018-10-10 14:42:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 14:42:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-10-10 14:42:05,582 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 110 [2018-10-10 14:42:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:05,582 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-10-10 14:42:05,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 14:42:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-10-10 14:42:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 14:42:05,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:05,584 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:05,585 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:05,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash -805446961, now seen corresponding path program 2 times [2018-10-10 14:42:05,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:05,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:05,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:05,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:07,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:07,366 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:07,414 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:07,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:07,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:07,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:07,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:07,520 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:07,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:07,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:07,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:07,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:07,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-10-10 14:42:07,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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:42:07,905 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:42:07,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:07,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:07,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-10 14:42:09,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:09,080 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:42:09,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:09,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:09,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:09,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:25 [2018-10-10 14:42:09,807 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:42:09,815 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:42:09,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:09,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:09,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:09,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:42:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:10,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:10,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 62 [2018-10-10 14:42:10,152 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:10,156 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:10,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:10 BoogieIcfgContainer [2018-10-10 14:42:10,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:10,157 INFO L168 Benchmark]: Toolchain (without parser) took 36109.30 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -294.9 MB). Peak memory consumption was 803.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:10,158 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:10,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.52 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:42:10,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:10,160 INFO L168 Benchmark]: Boogie Preprocessor took 52.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:10,160 INFO L168 Benchmark]: RCFGBuilder took 1024.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:10,161 INFO L168 Benchmark]: TraceAbstraction took 34499.20 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 312.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 513.0 MB). Peak memory consumption was 825.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:10,166 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 444.52 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 78.71 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 52.67 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 1024.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.1 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34499.20 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 312.5 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 513.0 MB). Peak memory consumption was 825.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 128 locations, 7 error locations. TIMEOUT Result, 34.4s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 20.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1039 SDtfs, 8309 SDslu, 7865 SDs, 0 SdLazy, 4467 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 187 SyntacticMatches, 4 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1814 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 236 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 942 NumberOfCodeBlocks, 942 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 930 ConstructedInterpolants, 33 QuantifiedInterpolants, 807270 SizeOfPredicates, 80 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 0/58 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...