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/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:44,379 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:44,381 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:44,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:44,393 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:44,394 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:44,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:44,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:44,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:44,404 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:44,405 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:44,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:44,408 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:44,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:44,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:44,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:44,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:44,421 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:44,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:44,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:44,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:44,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:44,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:44,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:44,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:44,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:44,440 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:44,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:44,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:44,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:44,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:44,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:44,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:44,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:44,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:44,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:44,450 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:41:44,476 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:44,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:44,478 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:44,478 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:44,479 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:44,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:44,480 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:44,480 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:44,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:44,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:44,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:44,481 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:44,481 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:44,481 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:44,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:44,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:44,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:44,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:44,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:44,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:44,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:44,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:44,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:44,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:44,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:44,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:41:44,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:44,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:44,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:44,574 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:44,574 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:44,575 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:44,884 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7052c3298/45701f20302440c1b59c248b4692527e/FLAG94abc349d [2018-10-10 14:41:45,180 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:45,181 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:45,205 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7052c3298/45701f20302440c1b59c248b4692527e/FLAG94abc349d [2018-10-10 14:41:45,222 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7052c3298/45701f20302440c1b59c248b4692527e [2018-10-10 14:41:45,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:45,234 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:45,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:45,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:45,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:45,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789554ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45, skipping insertion in model container [2018-10-10 14:41:45,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:45,314 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:45,566 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:45,580 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:45,648 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:45,700 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:45,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45 WrapperNode [2018-10-10 14:41:45,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:45,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:45,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:45,702 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:45,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:45,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:45,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:45,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:45,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... [2018-10-10 14:41:45,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:45,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:45,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:45,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:45,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:45,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:45,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:46,782 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:46,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:46 BoogieIcfgContainer [2018-10-10 14:41:46,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:46,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:46,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:46,788 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:46,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:45" (1/3) ... [2018-10-10 14:41:46,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732498e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:46, skipping insertion in model container [2018-10-10 14:41:46,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:45" (2/3) ... [2018-10-10 14:41:46,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732498e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:46, skipping insertion in model container [2018-10-10 14:41:46,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:46" (3/3) ... [2018-10-10 14:41:46,792 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:46,804 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:46,820 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-10-10 14:41:46,838 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-10-10 14:41:46,868 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:46,869 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:46,869 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:46,870 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:46,870 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:46,872 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:46,875 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:46,875 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:46,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2018-10-10 14:41:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:41:46,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:46,909 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] [2018-10-10 14:41:46,912 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:46,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:41:46,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:46,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:47,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:47,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:47,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:47,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:47,274 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 6 states. [2018-10-10 14:41:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:47,769 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-10 14:41:47,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:47,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-10 14:41:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:47,785 INFO L225 Difference]: With dead ends: 155 [2018-10-10 14:41:47,785 INFO L226 Difference]: Without dead ends: 150 [2018-10-10 14:41:47,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-10 14:41:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-10 14:41:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 14:41:47,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2018-10-10 14:41:47,836 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 46 [2018-10-10 14:41:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:47,837 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2018-10-10 14:41:47,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-10-10 14:41:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:41:47,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:47,839 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:47,840 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:47,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:47,841 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:41:47,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:47,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:47,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:47,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:48,344 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 14:41:48,558 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 14:41:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:48,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:48,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:48,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:48,674 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 9 states. [2018-10-10 14:41:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:49,392 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2018-10-10 14:41:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:41:49,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-10 14:41:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:49,395 INFO L225 Difference]: With dead ends: 194 [2018-10-10 14:41:49,395 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 14:41:49,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:41:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 14:41:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 149. [2018-10-10 14:41:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 14:41:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-10-10 14:41:49,421 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 47 [2018-10-10 14:41:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:49,422 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-10-10 14:41:49,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-10-10 14:41:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:41:49,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:49,426 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:41:49,429 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:49,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash -322152944, now seen corresponding path program 1 times [2018-10-10 14:41:49,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:49,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:49,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:49,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:49,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:41:49,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:41:49,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:41:49,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:49,664 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 10 states. [2018-10-10 14:41:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:50,188 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2018-10-10 14:41:50,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:41:50,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-10-10 14:41:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:50,192 INFO L225 Difference]: With dead ends: 168 [2018-10-10 14:41:50,192 INFO L226 Difference]: Without dead ends: 168 [2018-10-10 14:41:50,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:41:50,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-10 14:41:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2018-10-10 14:41:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 14:41:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2018-10-10 14:41:50,205 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 75 [2018-10-10 14:41:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:50,206 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2018-10-10 14:41:50,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:41:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-10-10 14:41:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 14:41:50,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:50,209 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:41:50,209 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:50,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1396806542, now seen corresponding path program 1 times [2018-10-10 14:41:50,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:50,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:50,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:50,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:41:50,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:41:50,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:41:50,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:50,492 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 13 states. [2018-10-10 14:41:50,992 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-10 14:41:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:51,941 INFO L93 Difference]: Finished difference Result 262 states and 268 transitions. [2018-10-10 14:41:51,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:41:51,942 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2018-10-10 14:41:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:51,945 INFO L225 Difference]: With dead ends: 262 [2018-10-10 14:41:51,945 INFO L226 Difference]: Without dead ends: 262 [2018-10-10 14:41:51,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:41:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-10 14:41:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 161. [2018-10-10 14:41:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 14:41:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2018-10-10 14:41:51,959 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 76 [2018-10-10 14:41:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:51,959 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2018-10-10 14:41:51,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:41:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2018-10-10 14:41:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 14:41:51,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:51,962 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:51,962 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:51,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1573787147, now seen corresponding path program 1 times [2018-10-10 14:41:51,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:51,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:51,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:51,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:52,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:52,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:52,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:41:52,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:41:52,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:41:52,053 INFO L87 Difference]: Start difference. First operand 161 states and 166 transitions. Second operand 5 states. [2018-10-10 14:41:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:52,121 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-10-10 14:41:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:41:52,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-10-10 14:41:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:52,124 INFO L225 Difference]: With dead ends: 161 [2018-10-10 14:41:52,124 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 14:41:52,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:41:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 14:41:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-10 14:41:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 14:41:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-10-10 14:41:52,133 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 85 [2018-10-10 14:41:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:52,133 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-10-10 14:41:52,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:41:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-10-10 14:41:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 14:41:52,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:52,136 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:52,136 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:52,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:52,137 INFO L82 PathProgramCache]: Analyzing trace with hash 737644504, now seen corresponding path program 1 times [2018-10-10 14:41:52,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:52,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:52,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:52,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:52,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:41:52,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:41:52,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:41:52,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:52,376 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 12 states. [2018-10-10 14:41:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:52,999 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-10-10 14:41:52,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:52,999 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2018-10-10 14:41:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:53,002 INFO L225 Difference]: With dead ends: 160 [2018-10-10 14:41:53,002 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 14:41:53,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:41:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 14:41:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-10-10 14:41:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-10 14:41:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2018-10-10 14:41:53,009 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 86 [2018-10-10 14:41:53,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:53,010 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2018-10-10 14:41:53,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:41:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-10-10 14:41:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 14:41:53,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:53,012 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:53,013 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:53,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1392143287, now seen corresponding path program 1 times [2018-10-10 14:41:53,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:53,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:53,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:53,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:41:53,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:41:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:41:53,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:53,534 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 17 states. [2018-10-10 14:41:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:54,868 INFO L93 Difference]: Finished difference Result 240 states and 246 transitions. [2018-10-10 14:41:54,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:41:54,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-10-10 14:41:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:54,873 INFO L225 Difference]: With dead ends: 240 [2018-10-10 14:41:54,873 INFO L226 Difference]: Without dead ends: 240 [2018-10-10 14:41:54,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:41:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-10 14:41:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 171. [2018-10-10 14:41:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 14:41:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2018-10-10 14:41:54,879 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 87 [2018-10-10 14:41:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:54,880 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2018-10-10 14:41:54,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:41:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2018-10-10 14:41:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:41:54,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:54,882 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:54,883 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:54,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:54,883 INFO L82 PathProgramCache]: Analyzing trace with hash -2101810311, now seen corresponding path program 1 times [2018-10-10 14:41:54,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:54,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:54,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:54,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:54,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:55,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:55,858 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:41:55,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:55,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:55,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:41:56,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:56,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:56,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:41:56,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:41:56,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:41:56,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:56,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:56,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:41:56,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:41:56,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:41:56,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:41:56,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:41:56,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:56,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:56,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:41:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:57,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2018-10-10 14:41:57,442 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/cstrncpy-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:41:57,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 14:41:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 14:41:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1096, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:41:57,448 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 35 states. [2018-10-10 14:41:59,129 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-10-10 14:41:59,484 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-10 14:41:59,899 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-10-10 14:42:00,334 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-10-10 14:42:00,584 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2018-10-10 14:42:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:02,017 INFO L93 Difference]: Finished difference Result 340 states and 347 transitions. [2018-10-10 14:42:02,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:42:02,017 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-10-10 14:42:02,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:02,021 INFO L225 Difference]: With dead ends: 340 [2018-10-10 14:42:02,021 INFO L226 Difference]: Without dead ends: 340 [2018-10-10 14:42:02,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=611, Invalid=3049, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 14:42:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-10 14:42:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 193. [2018-10-10 14:42:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 14:42:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 199 transitions. [2018-10-10 14:42:02,030 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 199 transitions. Word has length 109 [2018-10-10 14:42:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:02,031 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 199 transitions. [2018-10-10 14:42:02,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 14:42:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 199 transitions. [2018-10-10 14:42:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:42:02,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:02,033 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:02,034 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:02,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash 73319880, now seen corresponding path program 1 times [2018-10-10 14:42:02,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:02,193 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:02,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:02,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:02,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:02,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:02,195 INFO L87 Difference]: Start difference. First operand 193 states and 199 transitions. Second operand 9 states. [2018-10-10 14:42:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:02,652 INFO L93 Difference]: Finished difference Result 233 states and 239 transitions. [2018-10-10 14:42:02,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:42:02,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2018-10-10 14:42:02,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:02,656 INFO L225 Difference]: With dead ends: 233 [2018-10-10 14:42:02,656 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 14:42:02,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 14:42:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2018-10-10 14:42:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 14:42:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 198 transitions. [2018-10-10 14:42:02,661 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 198 transitions. Word has length 109 [2018-10-10 14:42:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:02,662 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 198 transitions. [2018-10-10 14:42:02,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 198 transitions. [2018-10-10 14:42:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 14:42:02,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:02,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:02,665 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:02,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2022050837, now seen corresponding path program 1 times [2018-10-10 14:42:02,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:02,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:02,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:03,111 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:42:03,284 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:42:03,861 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:03,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:03,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-10-10 14:42:03,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 14:42:03,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 14:42:03,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:42:03,863 INFO L87 Difference]: Start difference. First operand 192 states and 198 transitions. Second operand 28 states. [2018-10-10 14:42:05,913 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-10-10 14:42:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:07,166 INFO L93 Difference]: Finished difference Result 331 states and 336 transitions. [2018-10-10 14:42:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 14:42:07,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 110 [2018-10-10 14:42:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:07,168 INFO L225 Difference]: With dead ends: 331 [2018-10-10 14:42:07,168 INFO L226 Difference]: Without dead ends: 331 [2018-10-10 14:42:07,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=485, Invalid=2937, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 14:42:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-10 14:42:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 209. [2018-10-10 14:42:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 14:42:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 216 transitions. [2018-10-10 14:42:07,175 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 216 transitions. Word has length 110 [2018-10-10 14:42:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:07,176 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 216 transitions. [2018-10-10 14:42:07,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 14:42:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 216 transitions. [2018-10-10 14:42:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 14:42:07,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:07,178 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:07,178 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:07,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash 43541198, now seen corresponding path program 1 times [2018-10-10 14:42:07,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:07,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,859 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:08,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:42:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:08,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:08,273 INFO L87 Difference]: Start difference. First operand 209 states and 216 transitions. Second operand 16 states. [2018-10-10 14:42:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:09,111 INFO L93 Difference]: Finished difference Result 208 states and 215 transitions. [2018-10-10 14:42:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:09,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2018-10-10 14:42:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:09,112 INFO L225 Difference]: With dead ends: 208 [2018-10-10 14:42:09,112 INFO L226 Difference]: Without dead ends: 187 [2018-10-10 14:42:09,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-10 14:42:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-10 14:42:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-10 14:42:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2018-10-10 14:42:09,117 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 118 [2018-10-10 14:42:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:09,117 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2018-10-10 14:42:09,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2018-10-10 14:42:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 14:42:09,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:09,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:09,119 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:09,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash 866521680, now seen corresponding path program 1 times [2018-10-10 14:42:09,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:09,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:09,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,928 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:42:09,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:09,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:10,010 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:10,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:10,040 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:10,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:42:10,127 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:10,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:10,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:10,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:42:10,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:42:10,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:10,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:42:10,411 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:42:10,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:10,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 28 [2018-10-10 14:42:10,451 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/cstrncpy-alloca_true-valid-memsafety_true-termination.i_12.bpl [2018-10-10 14:42:10,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 14:42:10,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 14:42:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:42:10,454 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 29 states. [2018-10-10 14:42:12,671 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-10-10 14:42:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:13,203 INFO L93 Difference]: Finished difference Result 264 states and 269 transitions. [2018-10-10 14:42:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 14:42:13,204 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 120 [2018-10-10 14:42:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:13,206 INFO L225 Difference]: With dead ends: 264 [2018-10-10 14:42:13,206 INFO L226 Difference]: Without dead ends: 264 [2018-10-10 14:42:13,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=392, Invalid=2578, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 14:42:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-10 14:42:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 198. [2018-10-10 14:42:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 14:42:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 202 transitions. [2018-10-10 14:42:13,214 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 202 transitions. Word has length 120 [2018-10-10 14:42:13,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:13,214 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 202 transitions. [2018-10-10 14:42:13,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 14:42:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 202 transitions. [2018-10-10 14:42:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 14:42:13,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,216 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:13,216 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash 35161915, now seen corresponding path program 1 times [2018-10-10 14:42:13,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:13,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:14,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:14,324 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:14,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:14,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:14,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:14,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:14,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:42:14,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:14,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:14,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:14,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:42:14,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:42:14,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:14,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:42:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:16,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:16,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 63 [2018-10-10 14:42:16,399 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/cstrncpy-alloca_true-valid-memsafety_true-termination.i_13.bpl [2018-10-10 14:42:16,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 14:42:16,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 14:42:16,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=3869, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 14:42:16,402 INFO L87 Difference]: Start difference. First operand 198 states and 202 transitions. Second operand 64 states. [2018-10-10 14:42:18,485 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-10-10 14:42:18,955 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2018-10-10 14:42:19,149 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-10-10 14:42:19,453 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2018-10-10 14:42:20,071 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-10 14:42:20,346 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-10 14:42:20,962 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2018-10-10 14:42:21,221 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-10-10 14:42:21,511 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-10-10 14:42:21,748 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-10-10 14:42:22,061 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-10-10 14:42:22,336 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2018-10-10 14:42:22,657 WARN L178 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-10-10 14:42:23,063 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-10-10 14:42:23,400 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-10-10 14:42:23,687 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-10-10 14:42:24,147 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2018-10-10 14:42:24,375 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2018-10-10 14:42:24,705 WARN L178 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2018-10-10 14:42:24,972 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2018-10-10 14:42:25,265 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2018-10-10 14:42:25,680 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-10-10 14:42:25,994 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2018-10-10 14:42:26,278 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-10-10 14:42:26,636 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2018-10-10 14:42:26,878 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-10-10 14:42:27,201 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2018-10-10 14:42:27,506 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2018-10-10 14:42:27,894 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2018-10-10 14:42:28,162 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-10-10 14:42:28,489 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-10-10 14:42:28,727 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-10-10 14:42:29,021 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2018-10-10 14:42:29,232 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-10-10 14:42:29,545 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2018-10-10 14:42:29,850 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2018-10-10 14:42:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:29,861 INFO L93 Difference]: Finished difference Result 250 states and 254 transitions. [2018-10-10 14:42:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 14:42:29,861 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2018-10-10 14:42:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:29,862 INFO L225 Difference]: With dead ends: 250 [2018-10-10 14:42:29,862 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 14:42:29,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2318 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1381, Invalid=11959, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 14:42:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 14:42:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-10 14:42:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:42:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 184 transitions. [2018-10-10 14:42:29,870 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 184 transitions. Word has length 128 [2018-10-10 14:42:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:29,870 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 184 transitions. [2018-10-10 14:42:29,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 14:42:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2018-10-10 14:42:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 14:42:29,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:29,872 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:29,872 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:29,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1109961042, now seen corresponding path program 2 times [2018-10-10 14:42:29,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:29,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:29,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:30,868 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 22 [2018-10-10 14:42:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:31,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:31,556 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:42:31,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:31,612 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:31,612 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:31,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:31,634 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:31,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:31,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:31,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:31,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:31,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:31,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:31,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-10-10 14:42:32,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:32,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:32,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:32,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:32,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:32,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-10 14:42:33,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:33,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:33,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:33,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:25 [2018-10-10 14:42:33,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:33,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:33,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:33,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:33,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:33,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:42:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:34,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:34,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 62 [2018-10-10 14:42:34,088 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:34,092 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:34,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:34 BoogieIcfgContainer [2018-10-10 14:42:34,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:34,094 INFO L168 Benchmark]: Toolchain (without parser) took 48860.25 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -647.3 MB). Peak memory consumption was 563.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:34,095 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:34,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:34,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.82 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:34,096 INFO L168 Benchmark]: Boogie Preprocessor took 32.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:34,097 INFO L168 Benchmark]: RCFGBuilder took 987.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:34,098 INFO L168 Benchmark]: TraceAbstraction took 47309.24 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 469.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 574.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:34,101 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 465.50 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 60.82 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 32.75 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 987.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47309.24 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 469.8 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 574.0 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 14). - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 156 locations, 9 error locations. TIMEOUT Result, 47.2s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 30.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1816 SDtfs, 12869 SDslu, 16499 SDs, 0 SdLazy, 8392 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 779 GetRequests, 323 SyntacticMatches, 5 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4585 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 611 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 1553 NumberOfCodeBlocks, 1553 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1537 ConstructedInterpolants, 29 QuantifiedInterpolants, 1494479 SizeOfPredicates, 106 NumberOfNonLiveVariables, 744 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 2/100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...