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/strreplace-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:48,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:48,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:48,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:48,124 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:48,125 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:48,126 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:48,128 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:48,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:48,130 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:48,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:48,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:48,132 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:48,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:48,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:48,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:48,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:48,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:48,140 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:48,141 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:48,142 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:48,144 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:48,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:48,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:48,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:48,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:48,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:48,149 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:48,150 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:48,151 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:48,151 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:48,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:48,152 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:48,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:48,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:48,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:48,155 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:42:48,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:48,170 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:48,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:48,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:48,171 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:48,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:48,172 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:48,172 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:48,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:48,172 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:48,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:48,173 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:48,173 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:48,173 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:48,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:48,173 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:48,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:48,174 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:48,174 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:48,174 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:48,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:48,175 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:48,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:48,175 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:48,175 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:48,175 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:42:48,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:48,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:48,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:48,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:48,258 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:48,259 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:48,544 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde01341c/7f3b6de6f1ef4b418982c7550e4bd3f4/FLAG167e010ba [2018-10-10 14:42:48,880 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:48,881 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/strreplace-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:48,906 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde01341c/7f3b6de6f1ef4b418982c7550e4bd3f4/FLAG167e010ba [2018-10-10 14:42:48,926 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde01341c/7f3b6de6f1ef4b418982c7550e4bd3f4 [2018-10-10 14:42:48,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:48,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:48,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:48,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:48,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:48,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:48" (1/1) ... [2018-10-10 14:42:48,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259eba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:48, skipping insertion in model container [2018-10-10 14:42:48,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:48" (1/1) ... [2018-10-10 14:42:48,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:49,032 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:49,337 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:49,354 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:49,413 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:49,475 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:49,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49 WrapperNode [2018-10-10 14:42:49,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:49,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:49,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:49,479 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:49,490 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:42:49" (1/1) ... [2018-10-10 14:42:49,512 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:42:49" (1/1) ... [2018-10-10 14:42:49,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:49,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:49,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:49,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:49,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (1/1) ... [2018-10-10 14:42:49,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (1/1) ... [2018-10-10 14:42:49,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (1/1) ... [2018-10-10 14:42:49,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (1/1) ... [2018-10-10 14:42:49,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (1/1) ... [2018-10-10 14:42:49,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (1/1) ... [2018-10-10 14:42:49,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (1/1) ... [2018-10-10 14:42:49,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:49,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:49,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:49,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:49,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (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:42:49,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:49,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:50,396 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:50,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:50 BoogieIcfgContainer [2018-10-10 14:42:50,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:50,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:50,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:50,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:50,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:48" (1/3) ... [2018-10-10 14:42:50,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd679f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:50, skipping insertion in model container [2018-10-10 14:42:50,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:49" (2/3) ... [2018-10-10 14:42:50,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd679f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:50, skipping insertion in model container [2018-10-10 14:42:50,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:50" (3/3) ... [2018-10-10 14:42:50,405 INFO L112 eAbstractionObserver]: Analyzing ICFG strreplace-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:50,415 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:50,424 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-10-10 14:42:50,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-10-10 14:42:50,471 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:50,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:50,472 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:50,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:50,473 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:50,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:50,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:50,473 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:50,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-10-10 14:42:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-10 14:42:50,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:50,522 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] [2018-10-10 14:42:50,524 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:50,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1662470226, now seen corresponding path program 1 times [2018-10-10 14:42:50,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:50,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:50,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:50,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:50,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:50,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:50,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:50,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:50,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:50,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:50,825 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 6 states. [2018-10-10 14:42:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:51,343 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-10-10 14:42:51,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:51,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-10-10 14:42:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:51,357 INFO L225 Difference]: With dead ends: 119 [2018-10-10 14:42:51,357 INFO L226 Difference]: Without dead ends: 114 [2018-10-10 14:42:51,359 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:42:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-10 14:42:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-10-10 14:42:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 14:42:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-10-10 14:42:51,398 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 29 [2018-10-10 14:42:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:51,399 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-10-10 14:42:51,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-10-10 14:42:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 14:42:51,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:51,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:51,401 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:51,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 3030614, now seen corresponding path program 1 times [2018-10-10 14:42:51,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:51,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:51,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:51,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:51,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:51,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:51,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:51,692 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 9 states. [2018-10-10 14:42:52,089 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:42:52,646 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 14:42:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:52,739 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-10-10 14:42:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:52,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-10 14:42:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:52,742 INFO L225 Difference]: With dead ends: 167 [2018-10-10 14:42:52,743 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 14:42:52,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 14:42:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 113. [2018-10-10 14:42:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-10 14:42:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-10-10 14:42:52,755 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 30 [2018-10-10 14:42:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:52,756 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-10-10 14:42:52,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-10-10 14:42:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-10 14:42:52,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:52,758 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] [2018-10-10 14:42:52,759 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:52,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:52,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1391437378, now seen corresponding path program 1 times [2018-10-10 14:42:52,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:52,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:52,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:52,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:52,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:52,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:52,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:52,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:52,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:52,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:52,933 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 9 states. [2018-10-10 14:42:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:53,490 INFO L93 Difference]: Finished difference Result 171 states and 175 transitions. [2018-10-10 14:42:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:53,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-10-10 14:42:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:53,494 INFO L225 Difference]: With dead ends: 171 [2018-10-10 14:42:53,494 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 14:42:53,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 14:42:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 129. [2018-10-10 14:42:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 14:42:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 133 transitions. [2018-10-10 14:42:53,506 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 133 transitions. Word has length 50 [2018-10-10 14:42:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:53,507 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 133 transitions. [2018-10-10 14:42:53,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2018-10-10 14:42:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:42:53,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:53,509 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] [2018-10-10 14:42:53,509 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:53,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash 184885853, now seen corresponding path program 1 times [2018-10-10 14:42:53,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:53,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:53,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:53,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:53,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:53,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:53,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:53,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:53,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:53,758 INFO L87 Difference]: Start difference. First operand 129 states and 133 transitions. Second operand 12 states. [2018-10-10 14:42:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:54,623 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-10-10 14:42:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:42:54,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-10 14:42:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:54,626 INFO L225 Difference]: With dead ends: 178 [2018-10-10 14:42:54,626 INFO L226 Difference]: Without dead ends: 178 [2018-10-10 14:42:54,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:42:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-10 14:42:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 130. [2018-10-10 14:42:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-10 14:42:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-10-10 14:42:54,636 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 51 [2018-10-10 14:42:54,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:54,637 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-10-10 14:42:54,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:54,637 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-10-10 14:42:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:42:54,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:54,640 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,640 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:54,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash -303471412, now seen corresponding path program 1 times [2018-10-10 14:42:54,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:54,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:54,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:54,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:54,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:54,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:54,858 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 9 states. [2018-10-10 14:42:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:55,288 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-10 14:42:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:42:55,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-10-10 14:42:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:55,291 INFO L225 Difference]: With dead ends: 129 [2018-10-10 14:42:55,291 INFO L226 Difference]: Without dead ends: 112 [2018-10-10 14:42:55,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-10 14:42:55,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-10-10 14:42:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 14:42:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-10-10 14:42:55,303 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 75 [2018-10-10 14:42:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:55,303 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-10 14:42:55,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-10-10 14:42:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:42:55,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:55,306 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] [2018-10-10 14:42:55,307 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:55,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1315951083, now seen corresponding path program 1 times [2018-10-10 14:42:55,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:55,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:55,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:55,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:55,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:55,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:55,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:55,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:55,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:55,571 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 9 states. [2018-10-10 14:42:55,989 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-10 14:42:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:56,082 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-10-10 14:42:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:56,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-10-10 14:42:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:56,084 INFO L225 Difference]: With dead ends: 137 [2018-10-10 14:42:56,084 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 14:42:56,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 14:42:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2018-10-10 14:42:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-10 14:42:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2018-10-10 14:42:56,091 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 75 [2018-10-10 14:42:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:56,092 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2018-10-10 14:42:56,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-10-10 14:42:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 14:42:56,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:56,094 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] [2018-10-10 14:42:56,094 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:56,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2139778040, now seen corresponding path program 1 times [2018-10-10 14:42:56,095 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:56,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:56,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:56,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:56,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:56,394 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 12 states. [2018-10-10 14:42:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:56,994 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2018-10-10 14:42:56,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:42:56,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2018-10-10 14:42:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:57,000 INFO L225 Difference]: With dead ends: 174 [2018-10-10 14:42:57,001 INFO L226 Difference]: Without dead ends: 174 [2018-10-10 14:42:57,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-10 14:42:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 125. [2018-10-10 14:42:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 14:42:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 128 transitions. [2018-10-10 14:42:57,007 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 128 transitions. Word has length 76 [2018-10-10 14:42:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:57,007 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 128 transitions. [2018-10-10 14:42:57,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 128 transitions. [2018-10-10 14:42:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:42:57,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:57,009 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:57,009 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:57,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1883289043, now seen corresponding path program 1 times [2018-10-10 14:42:57,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:57,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:42:57,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:57,173 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:57,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:57,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:57,277 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:57,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:57,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:57,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:42:57,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:57,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-10 14:42:57,455 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/strreplace-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:42:57,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:57,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:57,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:57,460 INFO L87 Difference]: Start difference. First operand 125 states and 128 transitions. Second operand 10 states. [2018-10-10 14:42:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:57,922 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2018-10-10 14:42:57,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:57,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-10-10 14:42:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:57,927 INFO L225 Difference]: With dead ends: 123 [2018-10-10 14:42:57,927 INFO L226 Difference]: Without dead ends: 123 [2018-10-10 14:42:57,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-10 14:42:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-10 14:42:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 14:42:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2018-10-10 14:42:57,938 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 78 [2018-10-10 14:42:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:57,939 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2018-10-10 14:42:57,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-10-10 14:42:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:42:57,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:57,944 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:57,944 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:57,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:57,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1747581906, now seen corresponding path program 1 times [2018-10-10 14:42:57,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:57,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:58,730 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-10 14:42:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:59,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:59,228 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:59,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:59,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:59,383 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:59,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:59,609 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 16 treesize of output 13 [2018-10-10 14:42:59,612 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 13 treesize of output 12 [2018-10-10 14:42:59,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-10 14:42:59,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-10 14:42:59,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-10-10 14:42:59,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:59,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:59,996 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:42:59,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:27 [2018-10-10 14:43:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:00,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:00,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-10-10 14:43:00,300 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/strreplace-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:43:00,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 14:43:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 14:43:00,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:43:00,303 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 36 states. [2018-10-10 14:43:01,247 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-10 14:43:01,407 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2018-10-10 14:43:01,620 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-10-10 14:43:01,875 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2018-10-10 14:43:02,095 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2018-10-10 14:43:02,353 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2018-10-10 14:43:02,692 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2018-10-10 14:43:02,931 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2018-10-10 14:43:03,224 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-10-10 14:43:03,423 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2018-10-10 14:43:03,636 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-10-10 14:43:03,823 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2018-10-10 14:43:04,062 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2018-10-10 14:43:05,061 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-10-10 14:43:05,248 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2018-10-10 14:43:05,637 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-10-10 14:43:05,882 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-10 14:43:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:05,896 INFO L93 Difference]: Finished difference Result 268 states and 274 transitions. [2018-10-10 14:43:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 14:43:05,897 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-10-10 14:43:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:05,898 INFO L225 Difference]: With dead ends: 268 [2018-10-10 14:43:05,898 INFO L226 Difference]: Without dead ends: 268 [2018-10-10 14:43:05,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=866, Invalid=3166, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 14:43:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-10 14:43:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 152. [2018-10-10 14:43:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-10 14:43:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 155 transitions. [2018-10-10 14:43:05,906 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 155 transitions. Word has length 79 [2018-10-10 14:43:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:05,906 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 155 transitions. [2018-10-10 14:43:05,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 14:43:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 155 transitions. [2018-10-10 14:43:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 14:43:05,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:05,909 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:05,909 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:05,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash -622011296, now seen corresponding path program 1 times [2018-10-10 14:43:05,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:05,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-10 14:43:06,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:06,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:43:06,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:43:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:43:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:43:06,520 INFO L87 Difference]: Start difference. First operand 152 states and 155 transitions. Second operand 10 states. [2018-10-10 14:43:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:06,771 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-10-10 14:43:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:06,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-10-10 14:43:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:06,772 INFO L225 Difference]: With dead ends: 151 [2018-10-10 14:43:06,772 INFO L226 Difference]: Without dead ends: 151 [2018-10-10 14:43:06,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:43:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-10 14:43:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-10 14:43:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-10 14:43:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2018-10-10 14:43:06,776 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 103 [2018-10-10 14:43:06,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:06,777 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2018-10-10 14:43:06,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:43:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2018-10-10 14:43:06,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 14:43:06,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:06,779 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:06,779 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:06,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2102480861, now seen corresponding path program 1 times [2018-10-10 14:43:06,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:07,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:07,007 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:43:07,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:07,115 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:43:07,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,125 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:43:07,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-10-10 14:43:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:07,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:43:07,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2018-10-10 14:43:07,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 14:43:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 14:43:07,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:43:07,453 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand 22 states. [2018-10-10 14:43:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:08,473 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-10-10 14:43:08,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:43:08,473 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2018-10-10 14:43:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:08,474 INFO L225 Difference]: With dead ends: 184 [2018-10-10 14:43:08,474 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 14:43:08,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=398, Invalid=1084, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:43:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 14:43:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 150. [2018-10-10 14:43:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 14:43:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2018-10-10 14:43:08,482 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 104 [2018-10-10 14:43:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:08,482 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2018-10-10 14:43:08,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 14:43:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2018-10-10 14:43:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 14:43:08,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:08,488 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:08,488 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:08,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 25347015, now seen corresponding path program 2 times [2018-10-10 14:43:08,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:08,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:08,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:08,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:09,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:09,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:09,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:09,369 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:09,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:09,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:09,455 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:43:09,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,505 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:43:09,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-10 14:43:09,573 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:43:09,591 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:43:09,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:09,604 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:43:09,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-10-10 14:43:10,348 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:43:10,356 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:43:10,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:10,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:10,383 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:43:10,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:33 [2018-10-10 14:43:10,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:10,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 34 [2018-10-10 14:43:10,985 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:10,989 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:10,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:10 BoogieIcfgContainer [2018-10-10 14:43:10,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:10,991 INFO L168 Benchmark]: Toolchain (without parser) took 22050.14 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 994.1 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -270.6 MB). Peak memory consumption was 723.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:10,992 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:10,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 533.01 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:43:10,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.95 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:43:10,994 INFO L168 Benchmark]: Boogie Preprocessor took 30.08 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:43:10,994 INFO L168 Benchmark]: RCFGBuilder took 829.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:10,995 INFO L168 Benchmark]: TraceAbstraction took 20592.09 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 252.2 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 493.9 MB). Peak memory consumption was 746.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:10,999 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 533.01 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 59.95 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 30.08 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 829.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.7 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20592.09 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 252.2 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 493.9 MB). Peak memory consumption was 746.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 9 error locations. TIMEOUT Result, 20.5s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 964 SDtfs, 10327 SDslu, 3914 SDs, 0 SdLazy, 2367 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 483 GetRequests, 243 SyntacticMatches, 6 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 356 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1011 NumberOfCodeBlocks, 1011 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 997 ConstructedInterpolants, 0 QuantifiedInterpolants, 444987 SizeOfPredicates, 59 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 54/90 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...