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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:45:38,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:45:38,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:45:38,306 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:45:38,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:45:38,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:45:38,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:45:38,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:45:38,315 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:45:38,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:45:38,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:45:38,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:45:38,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:45:38,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:45:38,320 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:45:38,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:45:38,322 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:45:38,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:45:38,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:45:38,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:45:38,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:45:38,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:45:38,331 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:45:38,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:45:38,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:45:38,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:45:38,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:45:38,335 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:45:38,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:45:38,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:45:38,337 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:45:38,337 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:45:38,338 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:45:38,338 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:45:38,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:45:38,341 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:45:38,342 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:45:38,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:45:38,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:45:38,370 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:45:38,370 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:45:38,371 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:45:38,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:45:38,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:45:38,372 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:45:38,372 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:45:38,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:45:38,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:45:38,373 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:45:38,373 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:45:38,373 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:45:38,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:45:38,373 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:45:38,374 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:45:38,374 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:45:38,374 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:45:38,375 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:45:38,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:45:38,375 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:45:38,375 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:45:38,375 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:45:38,376 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:45:38,376 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:45:38,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:45:38,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:45:38,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:45:38,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:45:38,442 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:45:38,443 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-10-10 14:45:38,747 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71bc9ee8/d085f1b4d2bd440aa145a9b3a05983ca/FLAG8222843a3 [2018-10-10 14:45:39,080 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:45:39,081 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-10-10 14:45:39,103 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71bc9ee8/d085f1b4d2bd440aa145a9b3a05983ca/FLAG8222843a3 [2018-10-10 14:45:39,127 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71bc9ee8/d085f1b4d2bd440aa145a9b3a05983ca [2018-10-10 14:45:39,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:45:39,142 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:45:39,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:45:39,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:45:39,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:45:39,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efddc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39, skipping insertion in model container [2018-10-10 14:45:39,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:45:39,223 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:45:39,557 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:45:39,570 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:45:39,656 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:45:39,710 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:45:39,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39 WrapperNode [2018-10-10 14:45:39,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:45:39,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:45:39,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:45:39,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:45:39,723 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:45:39" (1/1) ... [2018-10-10 14:45:39,741 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:45:39" (1/1) ... [2018-10-10 14:45:39,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:45:39,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:45:39,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:45:39,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:45:39,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (1/1) ... [2018-10-10 14:45:39,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:45:39,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:45:39,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:45:39,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:45:39,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (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:45:40,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:45:40,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:45:40,986 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:45:40,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:45:40 BoogieIcfgContainer [2018-10-10 14:45:40,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:45:40,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:45:40,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:45:40,992 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:45:40,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:45:39" (1/3) ... [2018-10-10 14:45:40,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6e77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:45:40, skipping insertion in model container [2018-10-10 14:45:40,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:45:39" (2/3) ... [2018-10-10 14:45:40,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6e77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:45:40, skipping insertion in model container [2018-10-10 14:45:40,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:45:40" (3/3) ... [2018-10-10 14:45:40,996 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-10-10 14:45:41,006 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:45:41,016 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-10-10 14:45:41,035 INFO L257 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2018-10-10 14:45:41,069 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:45:41,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:45:41,071 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:45:41,072 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:45:41,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:45:41,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:45:41,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:45:41,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:45:41,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:45:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-10-10 14:45:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-10 14:45:41,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:41,116 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] [2018-10-10 14:45:41,119 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:41,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:41,128 INFO L82 PathProgramCache]: Analyzing trace with hash 420201100, now seen corresponding path program 1 times [2018-10-10 14:45:41,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:41,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:41,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:41,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:41,515 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:45:41,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:41,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:45:41,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:45:41,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:45:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:45:41,546 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-10-10 14:45:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:42,950 INFO L93 Difference]: Finished difference Result 359 states and 365 transitions. [2018-10-10 14:45:42,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:45:42,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-10 14:45:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:42,988 INFO L225 Difference]: With dead ends: 359 [2018-10-10 14:45:42,988 INFO L226 Difference]: Without dead ends: 344 [2018-10-10 14:45:42,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:45:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-10 14:45:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 208. [2018-10-10 14:45:43,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-10 14:45:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 211 transitions. [2018-10-10 14:45:43,075 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 211 transitions. Word has length 27 [2018-10-10 14:45:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:43,076 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 211 transitions. [2018-10-10 14:45:43,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:45:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 211 transitions. [2018-10-10 14:45:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-10 14:45:43,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:43,078 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] [2018-10-10 14:45:43,079 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:43,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:43,079 INFO L82 PathProgramCache]: Analyzing trace with hash 141332272, now seen corresponding path program 1 times [2018-10-10 14:45:43,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:43,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:43,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:43,269 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:45:43,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:43,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:45:43,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:45:43,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:45:43,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:45:43,272 INFO L87 Difference]: Start difference. First operand 208 states and 211 transitions. Second operand 8 states. [2018-10-10 14:45:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:43,875 INFO L93 Difference]: Finished difference Result 369 states and 376 transitions. [2018-10-10 14:45:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:45:43,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-10-10 14:45:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:43,879 INFO L225 Difference]: With dead ends: 369 [2018-10-10 14:45:43,879 INFO L226 Difference]: Without dead ends: 369 [2018-10-10 14:45:43,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:45:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-10 14:45:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 207. [2018-10-10 14:45:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 14:45:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 210 transitions. [2018-10-10 14:45:43,896 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 210 transitions. Word has length 28 [2018-10-10 14:45:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:43,897 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 210 transitions. [2018-10-10 14:45:43,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:45:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 210 transitions. [2018-10-10 14:45:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 14:45:43,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:43,902 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] [2018-10-10 14:45:43,903 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:43,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1994363254, now seen corresponding path program 1 times [2018-10-10 14:45:43,903 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:43,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:43,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:43,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:43,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:44,133 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:45:44,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:44,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:45:44,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:45:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:45:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:45:44,136 INFO L87 Difference]: Start difference. First operand 207 states and 210 transitions. Second operand 8 states. [2018-10-10 14:45:44,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:44,873 INFO L93 Difference]: Finished difference Result 368 states and 375 transitions. [2018-10-10 14:45:44,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:45:44,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-10-10 14:45:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:44,877 INFO L225 Difference]: With dead ends: 368 [2018-10-10 14:45:44,878 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 14:45:44,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:45:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 14:45:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 206. [2018-10-10 14:45:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 14:45:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 209 transitions. [2018-10-10 14:45:44,901 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 209 transitions. Word has length 38 [2018-10-10 14:45:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:44,901 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 209 transitions. [2018-10-10 14:45:44,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:45:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 209 transitions. [2018-10-10 14:45:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 14:45:44,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:44,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:44,905 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:44,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 111754172, now seen corresponding path program 1 times [2018-10-10 14:45:44,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:44,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:44,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:45,142 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:45:45,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:45,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:45:45,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:45:45,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:45:45,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:45:45,143 INFO L87 Difference]: Start difference. First operand 206 states and 209 transitions. Second operand 8 states. [2018-10-10 14:45:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:45,738 INFO L93 Difference]: Finished difference Result 367 states and 374 transitions. [2018-10-10 14:45:45,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:45:45,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-10-10 14:45:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:45,743 INFO L225 Difference]: With dead ends: 367 [2018-10-10 14:45:45,743 INFO L226 Difference]: Without dead ends: 367 [2018-10-10 14:45:45,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:45:45,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-10 14:45:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 205. [2018-10-10 14:45:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 14:45:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 208 transitions. [2018-10-10 14:45:45,752 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 208 transitions. Word has length 48 [2018-10-10 14:45:45,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:45,752 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 208 transitions. [2018-10-10 14:45:45,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:45:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 208 transitions. [2018-10-10 14:45:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:45:45,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:45,754 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:45,755 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:45,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash -611052919, now seen corresponding path program 1 times [2018-10-10 14:45:45,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:45,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:45,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:45,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:45,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:45,867 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:45:45,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:45,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:45:45,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:45:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:45:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:45:45,869 INFO L87 Difference]: Start difference. First operand 205 states and 208 transitions. Second operand 6 states. [2018-10-10 14:45:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:46,089 INFO L93 Difference]: Finished difference Result 358 states and 365 transitions. [2018-10-10 14:45:46,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:45:46,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-10-10 14:45:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:46,100 INFO L225 Difference]: With dead ends: 358 [2018-10-10 14:45:46,101 INFO L226 Difference]: Without dead ends: 358 [2018-10-10 14:45:46,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:45:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-10 14:45:46,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 211. [2018-10-10 14:45:46,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 14:45:46,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2018-10-10 14:45:46,112 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 62 [2018-10-10 14:45:46,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:46,113 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2018-10-10 14:45:46,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:45:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2018-10-10 14:45:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-10 14:45:46,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:46,115 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] [2018-10-10 14:45:46,116 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:46,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:46,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1188332555, now seen corresponding path program 1 times [2018-10-10 14:45:46,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:46,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:46,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:46,357 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:45:46,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:46,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:45:46,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:45:46,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:45:46,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:45:46,360 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 7 states. [2018-10-10 14:45:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:47,033 INFO L93 Difference]: Finished difference Result 342 states and 348 transitions. [2018-10-10 14:45:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:45:47,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-10-10 14:45:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:47,039 INFO L225 Difference]: With dead ends: 342 [2018-10-10 14:45:47,039 INFO L226 Difference]: Without dead ends: 342 [2018-10-10 14:45:47,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:45:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-10 14:45:47,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 242. [2018-10-10 14:45:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-10 14:45:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 250 transitions. [2018-10-10 14:45:47,049 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 250 transitions. Word has length 64 [2018-10-10 14:45:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:47,050 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 250 transitions. [2018-10-10 14:45:47,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:45:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 250 transitions. [2018-10-10 14:45:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 14:45:47,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:47,052 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:47,052 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:47,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1816396254, now seen corresponding path program 1 times [2018-10-10 14:45:47,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:47,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:47,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:47,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:47,251 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:45:47,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:47,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:45:47,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:45:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:45:47,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:45:47,252 INFO L87 Difference]: Start difference. First operand 242 states and 250 transitions. Second operand 9 states. [2018-10-10 14:45:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:48,082 INFO L93 Difference]: Finished difference Result 429 states and 437 transitions. [2018-10-10 14:45:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:45:48,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-10-10 14:45:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:48,085 INFO L225 Difference]: With dead ends: 429 [2018-10-10 14:45:48,086 INFO L226 Difference]: Without dead ends: 429 [2018-10-10 14:45:48,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:45:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-10 14:45:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 259. [2018-10-10 14:45:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-10 14:45:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 268 transitions. [2018-10-10 14:45:48,094 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 268 transitions. Word has length 65 [2018-10-10 14:45:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:48,095 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 268 transitions. [2018-10-10 14:45:48,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:45:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 268 transitions. [2018-10-10 14:45:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:45:48,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:48,097 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:45:48,098 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:48,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1315334513, now seen corresponding path program 1 times [2018-10-10 14:45:48,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:48,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:48,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:48,182 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:45:48,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:48,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:45:48,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:45:48,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:45:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:45:48,183 INFO L87 Difference]: Start difference. First operand 259 states and 268 transitions. Second operand 6 states. [2018-10-10 14:45:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:48,648 INFO L93 Difference]: Finished difference Result 394 states and 406 transitions. [2018-10-10 14:45:48,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:45:48,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-10-10 14:45:48,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:48,653 INFO L225 Difference]: With dead ends: 394 [2018-10-10 14:45:48,653 INFO L226 Difference]: Without dead ends: 394 [2018-10-10 14:45:48,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:45:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-10 14:45:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 257. [2018-10-10 14:45:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-10 14:45:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 266 transitions. [2018-10-10 14:45:48,661 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 266 transitions. Word has length 75 [2018-10-10 14:45:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:48,661 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 266 transitions. [2018-10-10 14:45:48,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:45:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 266 transitions. [2018-10-10 14:45:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 14:45:48,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:48,663 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:45:48,664 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:48,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:48,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2120664116, now seen corresponding path program 1 times [2018-10-10 14:45:48,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:48,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:48,848 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:45:48,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:48,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:45:48,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:45:48,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:45:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:45:48,849 INFO L87 Difference]: Start difference. First operand 257 states and 266 transitions. Second operand 8 states. [2018-10-10 14:45:49,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:49,480 INFO L93 Difference]: Finished difference Result 414 states and 426 transitions. [2018-10-10 14:45:49,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:45:49,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2018-10-10 14:45:49,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:49,483 INFO L225 Difference]: With dead ends: 414 [2018-10-10 14:45:49,483 INFO L226 Difference]: Without dead ends: 414 [2018-10-10 14:45:49,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:45:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-10 14:45:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 256. [2018-10-10 14:45:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-10 14:45:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 265 transitions. [2018-10-10 14:45:49,489 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 265 transitions. Word has length 76 [2018-10-10 14:45:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:49,489 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 265 transitions. [2018-10-10 14:45:49,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:45:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 265 transitions. [2018-10-10 14:45:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:45:49,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:49,491 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:45:49,492 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:49,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash -455401015, now seen corresponding path program 1 times [2018-10-10 14:45:49,492 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:49,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:49,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:49,794 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:45:49,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:49,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:45:49,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:45:49,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:45:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:45:49,795 INFO L87 Difference]: Start difference. First operand 256 states and 265 transitions. Second operand 9 states. [2018-10-10 14:45:50,346 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 14:45:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:50,869 INFO L93 Difference]: Finished difference Result 426 states and 434 transitions. [2018-10-10 14:45:50,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:45:50,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2018-10-10 14:45:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:50,873 INFO L225 Difference]: With dead ends: 426 [2018-10-10 14:45:50,873 INFO L226 Difference]: Without dead ends: 426 [2018-10-10 14:45:50,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:45:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-10 14:45:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 256. [2018-10-10 14:45:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-10 14:45:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 263 transitions. [2018-10-10 14:45:50,880 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 263 transitions. Word has length 77 [2018-10-10 14:45:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:50,880 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 263 transitions. [2018-10-10 14:45:50,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:45:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 263 transitions. [2018-10-10 14:45:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 14:45:50,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:50,882 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:45:50,882 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:50,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1166603445, now seen corresponding path program 1 times [2018-10-10 14:45:50,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:51,706 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-10 14:45:51,724 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:45:51,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:51,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:45:51,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:45:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:45:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:45:51,726 INFO L87 Difference]: Start difference. First operand 256 states and 263 transitions. Second operand 9 states. [2018-10-10 14:45:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:52,724 INFO L93 Difference]: Finished difference Result 400 states and 407 transitions. [2018-10-10 14:45:52,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:45:52,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-10-10 14:45:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:52,728 INFO L225 Difference]: With dead ends: 400 [2018-10-10 14:45:52,728 INFO L226 Difference]: Without dead ends: 400 [2018-10-10 14:45:52,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:45:52,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-10 14:45:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 284. [2018-10-10 14:45:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-10 14:45:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 291 transitions. [2018-10-10 14:45:52,735 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 291 transitions. Word has length 85 [2018-10-10 14:45:52,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:52,736 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 291 transitions. [2018-10-10 14:45:52,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:45:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 291 transitions. [2018-10-10 14:45:52,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 14:45:52,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:52,737 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:45:52,738 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:52,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:52,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1804968562, now seen corresponding path program 1 times [2018-10-10 14:45:52,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:52,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:52,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:52,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:52,967 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:45:52,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:52,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:45:52,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:45:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:45:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:45:52,969 INFO L87 Difference]: Start difference. First operand 284 states and 291 transitions. Second operand 13 states. [2018-10-10 14:45:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:54,289 INFO L93 Difference]: Finished difference Result 458 states and 467 transitions. [2018-10-10 14:45:54,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:45:54,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-10-10 14:45:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:54,292 INFO L225 Difference]: With dead ends: 458 [2018-10-10 14:45:54,292 INFO L226 Difference]: Without dead ends: 458 [2018-10-10 14:45:54,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:45:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-10 14:45:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 285. [2018-10-10 14:45:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 14:45:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 292 transitions. [2018-10-10 14:45:54,299 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 292 transitions. Word has length 86 [2018-10-10 14:45:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:54,299 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 292 transitions. [2018-10-10 14:45:54,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:45:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 292 transitions. [2018-10-10 14:45:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:45:54,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:54,301 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] [2018-10-10 14:45:54,301 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:54,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:54,302 INFO L82 PathProgramCache]: Analyzing trace with hash -165042016, now seen corresponding path program 1 times [2018-10-10 14:45:54,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:54,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:54,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:54,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:54,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:54,843 WARN L178 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-10-10 14:45:54,937 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:45:54,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:45:54,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:45:54,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:45:54,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:45:54,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:45:54,938 INFO L87 Difference]: Start difference. First operand 285 states and 292 transitions. Second operand 11 states. [2018-10-10 14:45:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:55,734 INFO L93 Difference]: Finished difference Result 282 states and 286 transitions. [2018-10-10 14:45:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:45:55,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-10-10 14:45:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:55,737 INFO L225 Difference]: With dead ends: 282 [2018-10-10 14:45:55,737 INFO L226 Difference]: Without dead ends: 282 [2018-10-10 14:45:55,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:45:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-10 14:45:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 264. [2018-10-10 14:45:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 14:45:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 268 transitions. [2018-10-10 14:45:55,742 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 268 transitions. Word has length 96 [2018-10-10 14:45:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:55,743 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 268 transitions. [2018-10-10 14:45:55,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:45:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 268 transitions. [2018-10-10 14:45:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 14:45:55,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:55,744 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] [2018-10-10 14:45:55,745 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:55,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1040723527, now seen corresponding path program 1 times [2018-10-10 14:45:55,745 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:55,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:45:56,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:45:56,758 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:45:56,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:45:56,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:45:57,455 WARN L854 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_ULTIMATE.dealloc_~addr.base Int)) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid| ULTIMATE.start_ULTIMATE.dealloc_~addr.base 0)) (= (select |c_ULTIMATE.start_main_old_#valid| ULTIMATE.start_ULTIMATE.dealloc_~addr.base) 0))) is different from true [2018-10-10 14:45:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-10 14:45:57,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:45:57,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-10-10 14:45:57,627 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_14.bpl [2018-10-10 14:45:57,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 14:45:57,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 14:45:57,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=235, Unknown=1, NotChecked=30, Total=306 [2018-10-10 14:45:57,633 INFO L87 Difference]: Start difference. First operand 264 states and 268 transitions. Second operand 18 states. [2018-10-10 14:45:58,988 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-10-10 14:45:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:45:59,640 INFO L93 Difference]: Finished difference Result 400 states and 406 transitions. [2018-10-10 14:45:59,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:45:59,641 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2018-10-10 14:45:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:45:59,644 INFO L225 Difference]: With dead ends: 400 [2018-10-10 14:45:59,644 INFO L226 Difference]: Without dead ends: 398 [2018-10-10 14:45:59,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=210, Invalid=785, Unknown=1, NotChecked=60, Total=1056 [2018-10-10 14:45:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-10 14:45:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 272. [2018-10-10 14:45:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-10 14:45:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 276 transitions. [2018-10-10 14:45:59,650 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 276 transitions. Word has length 97 [2018-10-10 14:45:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:45:59,650 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 276 transitions. [2018-10-10 14:45:59,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 14:45:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 276 transitions. [2018-10-10 14:45:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:45:59,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:45:59,652 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:45:59,652 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:45:59,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:45:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash 591738683, now seen corresponding path program 1 times [2018-10-10 14:45:59,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:45:59,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:45:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:59,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:45:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:45:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:00,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:00,137 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:46:00,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:00,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:00,429 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:46:00,448 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:46:00,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,590 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:46:00,605 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:46:00,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-10-10 14:46:00,834 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 19 treesize of output 14 [2018-10-10 14:46:00,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 18 [2018-10-10 14:46:00,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,861 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 19 treesize of output 14 [2018-10-10 14:46:00,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 18 [2018-10-10 14:46:00,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:46:00,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-10-10 14:46:00,924 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 19 treesize of output 14 [2018-10-10 14:46:00,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:00,942 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 14 treesize of output 19 [2018-10-10 14:46:00,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,963 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 19 treesize of output 14 [2018-10-10 14:46:00,980 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:00,982 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 14 treesize of output 19 [2018-10-10 14:46:00,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:00,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:40, output treesize:15 [2018-10-10 14:46:01,108 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:46:01,114 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:46:01,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:01,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:01,130 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:46:01,136 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:46:01,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:01,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:01,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:01,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:12 [2018-10-10 14:46:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:01,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:46:01,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 23 [2018-10-10 14:46:01,297 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_15.bpl [2018-10-10 14:46:01,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 14:46:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 14:46:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:46:01,299 INFO L87 Difference]: Start difference. First operand 272 states and 276 transitions. Second operand 23 states. [2018-10-10 14:46:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:03,768 INFO L93 Difference]: Finished difference Result 278 states and 281 transitions. [2018-10-10 14:46:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:46:03,768 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2018-10-10 14:46:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:03,770 INFO L225 Difference]: With dead ends: 278 [2018-10-10 14:46:03,771 INFO L226 Difference]: Without dead ends: 240 [2018-10-10 14:46:03,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 84 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=415, Invalid=1841, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:46:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-10 14:46:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2018-10-10 14:46:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 14:46:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 237 transitions. [2018-10-10 14:46:03,776 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 237 transitions. Word has length 99 [2018-10-10 14:46:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:03,777 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 237 transitions. [2018-10-10 14:46:03,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 14:46:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 237 transitions. [2018-10-10 14:46:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:46:03,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:03,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:03,779 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:03,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:03,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1229999994, now seen corresponding path program 1 times [2018-10-10 14:46:03,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:03,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:03,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:03,984 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:46:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:46:03,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:46:03,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:46:03,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:46:03,985 INFO L87 Difference]: Start difference. First operand 234 states and 237 transitions. Second operand 8 states. [2018-10-10 14:46:04,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:04,362 INFO L93 Difference]: Finished difference Result 318 states and 323 transitions. [2018-10-10 14:46:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:46:04,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2018-10-10 14:46:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:04,365 INFO L225 Difference]: With dead ends: 318 [2018-10-10 14:46:04,365 INFO L226 Difference]: Without dead ends: 318 [2018-10-10 14:46:04,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:46:04,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-10 14:46:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 233. [2018-10-10 14:46:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-10 14:46:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 236 transitions. [2018-10-10 14:46:04,370 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 236 transitions. Word has length 99 [2018-10-10 14:46:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:04,371 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 236 transitions. [2018-10-10 14:46:04,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:46:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 236 transitions. [2018-10-10 14:46:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 14:46:04,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:04,372 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:46:04,373 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:04,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash 186188479, now seen corresponding path program 1 times [2018-10-10 14:46:04,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:04,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:04,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:05,047 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-10 14:46:05,189 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:46:05,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:05,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:46:05,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:46:05,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:46:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:46:05,191 INFO L87 Difference]: Start difference. First operand 233 states and 236 transitions. Second operand 8 states. [2018-10-10 14:46:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:05,656 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2018-10-10 14:46:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:46:05,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2018-10-10 14:46:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:05,659 INFO L225 Difference]: With dead ends: 308 [2018-10-10 14:46:05,659 INFO L226 Difference]: Without dead ends: 308 [2018-10-10 14:46:05,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:46:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-10 14:46:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 232. [2018-10-10 14:46:05,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-10 14:46:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 235 transitions. [2018-10-10 14:46:05,664 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 235 transitions. Word has length 110 [2018-10-10 14:46:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:05,665 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 235 transitions. [2018-10-10 14:46:05,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:46:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 235 transitions. [2018-10-10 14:46:05,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 14:46:05,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:05,666 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, 1] [2018-10-10 14:46:05,667 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:05,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:05,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1476875717, now seen corresponding path program 1 times [2018-10-10 14:46:05,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:05,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:05,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:05,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:06,355 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:46:06,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:06,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-10-10 14:46:06,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 14:46:06,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 14:46:06,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:46:06,356 INFO L87 Difference]: Start difference. First operand 232 states and 235 transitions. Second operand 23 states. [2018-10-10 14:46:08,388 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-10 14:46:08,966 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-10-10 14:46:09,215 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-10-10 14:46:10,161 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2018-10-10 14:46:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:11,344 INFO L93 Difference]: Finished difference Result 673 states and 685 transitions. [2018-10-10 14:46:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 14:46:11,344 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 111 [2018-10-10 14:46:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:11,347 INFO L225 Difference]: With dead ends: 673 [2018-10-10 14:46:11,347 INFO L226 Difference]: Without dead ends: 673 [2018-10-10 14:46:11,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=587, Invalid=3073, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 14:46:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-10 14:46:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 331. [2018-10-10 14:46:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-10 14:46:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 345 transitions. [2018-10-10 14:46:11,356 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 345 transitions. Word has length 111 [2018-10-10 14:46:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:11,356 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 345 transitions. [2018-10-10 14:46:11,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 14:46:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 345 transitions. [2018-10-10 14:46:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 14:46:11,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:11,357 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:11,358 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:11,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1738978200, now seen corresponding path program 1 times [2018-10-10 14:46:11,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:11,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:11,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:11,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:11,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:11,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:11,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:46:11,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:46:11,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:46:11,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:46:11,677 INFO L87 Difference]: Start difference. First operand 331 states and 345 transitions. Second operand 6 states. [2018-10-10 14:46:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:11,819 INFO L93 Difference]: Finished difference Result 444 states and 460 transitions. [2018-10-10 14:46:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:46:11,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-10-10 14:46:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:11,822 INFO L225 Difference]: With dead ends: 444 [2018-10-10 14:46:11,822 INFO L226 Difference]: Without dead ends: 444 [2018-10-10 14:46:11,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:46:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-10 14:46:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 333. [2018-10-10 14:46:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-10 14:46:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 346 transitions. [2018-10-10 14:46:11,828 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 346 transitions. Word has length 113 [2018-10-10 14:46:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:11,829 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 346 transitions. [2018-10-10 14:46:11,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:46:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 346 transitions. [2018-10-10 14:46:11,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 14:46:11,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:11,830 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:11,830 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:11,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:11,831 INFO L82 PathProgramCache]: Analyzing trace with hash -416103894, now seen corresponding path program 1 times [2018-10-10 14:46:11,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:11,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:11,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:11,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:11,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:12,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:12,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:46:12,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:46:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:46:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:46:12,046 INFO L87 Difference]: Start difference. First operand 333 states and 346 transitions. Second operand 6 states. [2018-10-10 14:46:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:12,377 INFO L93 Difference]: Finished difference Result 395 states and 407 transitions. [2018-10-10 14:46:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:46:12,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-10-10 14:46:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:12,380 INFO L225 Difference]: With dead ends: 395 [2018-10-10 14:46:12,381 INFO L226 Difference]: Without dead ends: 395 [2018-10-10 14:46:12,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:46:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-10 14:46:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 334. [2018-10-10 14:46:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-10 14:46:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 345 transitions. [2018-10-10 14:46:12,386 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 345 transitions. Word has length 115 [2018-10-10 14:46:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:12,386 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 345 transitions. [2018-10-10 14:46:12,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:46:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 345 transitions. [2018-10-10 14:46:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 14:46:12,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:12,387 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:12,388 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:12,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash -14318621, now seen corresponding path program 1 times [2018-10-10 14:46:12,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:12,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:12,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:12,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:12,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:12,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:12,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:46:12,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:46:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:46:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:46:12,581 INFO L87 Difference]: Start difference. First operand 334 states and 345 transitions. Second operand 10 states. [2018-10-10 14:46:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:13,069 INFO L93 Difference]: Finished difference Result 369 states and 377 transitions. [2018-10-10 14:46:13,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:46:13,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-10-10 14:46:13,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:13,072 INFO L225 Difference]: With dead ends: 369 [2018-10-10 14:46:13,072 INFO L226 Difference]: Without dead ends: 369 [2018-10-10 14:46:13,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:46:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-10 14:46:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 351. [2018-10-10 14:46:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-10 14:46:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 363 transitions. [2018-10-10 14:46:13,076 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 363 transitions. Word has length 116 [2018-10-10 14:46:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:13,077 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 363 transitions. [2018-10-10 14:46:13,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:46:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 363 transitions. [2018-10-10 14:46:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 14:46:13,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:13,078 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:13,079 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:13,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1575816714, now seen corresponding path program 1 times [2018-10-10 14:46:13,079 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:13,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:13,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:13,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:13,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:46:13,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:46:13,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:46:13,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:46:13,303 INFO L87 Difference]: Start difference. First operand 351 states and 363 transitions. Second operand 10 states. [2018-10-10 14:46:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:13,928 INFO L93 Difference]: Finished difference Result 498 states and 513 transitions. [2018-10-10 14:46:13,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:46:13,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 128 [2018-10-10 14:46:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:13,934 INFO L225 Difference]: With dead ends: 498 [2018-10-10 14:46:13,934 INFO L226 Difference]: Without dead ends: 498 [2018-10-10 14:46:13,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:46:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-10 14:46:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 387. [2018-10-10 14:46:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-10 14:46:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 401 transitions. [2018-10-10 14:46:13,940 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 401 transitions. Word has length 128 [2018-10-10 14:46:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:13,940 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 401 transitions. [2018-10-10 14:46:13,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:46:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 401 transitions. [2018-10-10 14:46:13,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 14:46:13,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:13,941 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:13,942 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:13,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:13,942 INFO L82 PathProgramCache]: Analyzing trace with hash -649129994, now seen corresponding path program 1 times [2018-10-10 14:46:13,942 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:13,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:13,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:13,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:14,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:14,637 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:46:14,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:14,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:14,712 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:46:14,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:14,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:14,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:46:14,853 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:14,856 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:14,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-10-10 14:46:14,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:14,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:46:14,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-10-10 14:46:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:15,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:46:15,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-10-10 14:46:15,033 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_23.bpl [2018-10-10 14:46:15,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:46:15,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:46:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:46:15,034 INFO L87 Difference]: Start difference. First operand 387 states and 401 transitions. Second operand 14 states. [2018-10-10 14:46:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:16,388 INFO L93 Difference]: Finished difference Result 421 states and 430 transitions. [2018-10-10 14:46:16,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:46:16,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-10-10 14:46:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:16,392 INFO L225 Difference]: With dead ends: 421 [2018-10-10 14:46:16,392 INFO L226 Difference]: Without dead ends: 421 [2018-10-10 14:46:16,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=401, Invalid=1159, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:46:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-10 14:46:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 386. [2018-10-10 14:46:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-10 14:46:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 399 transitions. [2018-10-10 14:46:16,398 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 399 transitions. Word has length 136 [2018-10-10 14:46:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:16,399 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 399 transitions. [2018-10-10 14:46:16,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:46:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 399 transitions. [2018-10-10 14:46:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 14:46:16,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:16,400 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:16,400 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:16,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1351806801, now seen corresponding path program 1 times [2018-10-10 14:46:16,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:16,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:16,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:16,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:16,981 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:46:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:17,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:17,066 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:46:17,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:17,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:17,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:46:17,149 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:46:17,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:17,243 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:46:17,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:46:17,319 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:17,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:17,321 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:46:17,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:17,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:17,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:46:17,332 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:46:17,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:17,339 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:46:17,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-10-10 14:46:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:17,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:46:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2018-10-10 14:46:17,586 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_24.bpl [2018-10-10 14:46:17,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 14:46:17,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 14:46:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:46:17,588 INFO L87 Difference]: Start difference. First operand 386 states and 399 transitions. Second operand 19 states. [2018-10-10 14:46:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:19,566 INFO L93 Difference]: Finished difference Result 558 states and 573 transitions. [2018-10-10 14:46:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:46:19,567 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 137 [2018-10-10 14:46:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:19,569 INFO L225 Difference]: With dead ends: 558 [2018-10-10 14:46:19,569 INFO L226 Difference]: Without dead ends: 558 [2018-10-10 14:46:19,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=360, Invalid=1280, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 14:46:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-10-10 14:46:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 386. [2018-10-10 14:46:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-10 14:46:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 398 transitions. [2018-10-10 14:46:19,575 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 398 transitions. Word has length 137 [2018-10-10 14:46:19,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:19,575 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 398 transitions. [2018-10-10 14:46:19,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 14:46:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 398 transitions. [2018-10-10 14:46:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 14:46:19,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:19,576 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:19,577 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:19,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:19,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1056170064, now seen corresponding path program 1 times [2018-10-10 14:46:19,577 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:19,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:19,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:19,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:19,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:19,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:46:19,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:46:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:46:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:46:19,844 INFO L87 Difference]: Start difference. First operand 386 states and 398 transitions. Second operand 12 states. [2018-10-10 14:46:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:20,671 INFO L93 Difference]: Finished difference Result 418 states and 426 transitions. [2018-10-10 14:46:20,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:46:20,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2018-10-10 14:46:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:20,674 INFO L225 Difference]: With dead ends: 418 [2018-10-10 14:46:20,674 INFO L226 Difference]: Without dead ends: 418 [2018-10-10 14:46:20,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=429, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:46:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-10 14:46:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 354. [2018-10-10 14:46:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-10 14:46:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 363 transitions. [2018-10-10 14:46:20,678 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 363 transitions. Word has length 140 [2018-10-10 14:46:20,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:20,679 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 363 transitions. [2018-10-10 14:46:20,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:46:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 363 transitions. [2018-10-10 14:46:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 14:46:20,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:20,680 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:20,680 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:20,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:20,683 INFO L82 PathProgramCache]: Analyzing trace with hash 456108735, now seen corresponding path program 1 times [2018-10-10 14:46:20,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:20,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:20,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:20,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:20,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:21,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:46:21,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:46:21,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:46:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:46:21,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:46:21,203 INFO L87 Difference]: Start difference. First operand 354 states and 363 transitions. Second operand 13 states. [2018-10-10 14:46:21,611 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-10 14:46:22,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:22,507 INFO L93 Difference]: Finished difference Result 408 states and 417 transitions. [2018-10-10 14:46:22,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 14:46:22,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2018-10-10 14:46:22,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:22,510 INFO L225 Difference]: With dead ends: 408 [2018-10-10 14:46:22,510 INFO L226 Difference]: Without dead ends: 408 [2018-10-10 14:46:22,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 14:46:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-10 14:46:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 381. [2018-10-10 14:46:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-10 14:46:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 390 transitions. [2018-10-10 14:46:22,515 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 390 transitions. Word has length 147 [2018-10-10 14:46:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:22,516 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 390 transitions. [2018-10-10 14:46:22,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:46:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 390 transitions. [2018-10-10 14:46:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-10 14:46:22,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:22,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:22,517 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:22,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1035080570, now seen corresponding path program 1 times [2018-10-10 14:46:22,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:22,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:22,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:22,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:22,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:23,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:23,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:23,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:46:23,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:23,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:23,167 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:46:23,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:46:23,203 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:23,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:23,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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:46:23,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-10-10 14:46:23,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:46:23,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:46:23,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-10 14:46:23,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-10-10 14:46:23,502 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 12 treesize of output 11 [2018-10-10 14:46:23,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:23,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-10 14:46:23,622 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 28 treesize of output 21 [2018-10-10 14:46:23,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 27 [2018-10-10 14:46:23,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:23,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:23,663 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 2 xjuncts. [2018-10-10 14:46:23,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:41 [2018-10-10 14:46:23,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 17 [2018-10-10 14:46:23,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 29 [2018-10-10 14:46:23,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-10-10 14:46:23,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:46:24,252 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:46:24,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2018-10-10 14:46:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:24,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:46:24,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 44 [2018-10-10 14:46:24,721 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_27.bpl [2018-10-10 14:46:24,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 14:46:24,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 14:46:24,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 14:46:24,723 INFO L87 Difference]: Start difference. First operand 381 states and 390 transitions. Second operand 44 states. [2018-10-10 14:46:26,234 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-10-10 14:46:26,733 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2018-10-10 14:46:27,475 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-10-10 14:46:27,774 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2018-10-10 14:46:28,329 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2018-10-10 14:46:28,637 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2018-10-10 14:46:28,839 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2018-10-10 14:46:29,289 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-10-10 14:46:30,462 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-10-10 14:46:30,791 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-10 14:46:30,978 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2018-10-10 14:46:31,521 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-10-10 14:46:31,673 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-10-10 14:46:32,463 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-10-10 14:46:32,870 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-10-10 14:46:33,744 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2018-10-10 14:46:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:35,078 INFO L93 Difference]: Finished difference Result 445 states and 452 transitions. [2018-10-10 14:46:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 14:46:35,078 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 148 [2018-10-10 14:46:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:35,080 INFO L225 Difference]: With dead ends: 445 [2018-10-10 14:46:35,080 INFO L226 Difference]: Without dead ends: 445 [2018-10-10 14:46:35,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3415 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1940, Invalid=12340, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 14:46:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-10 14:46:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 390. [2018-10-10 14:46:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-10 14:46:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 400 transitions. [2018-10-10 14:46:35,088 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 400 transitions. Word has length 148 [2018-10-10 14:46:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:35,089 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 400 transitions. [2018-10-10 14:46:35,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 14:46:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 400 transitions. [2018-10-10 14:46:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 14:46:35,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:35,090 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,091 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:35,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1093487563, now seen corresponding path program 1 times [2018-10-10 14:46:35,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:35,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:35,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:35,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:35,509 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:46:35,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:35,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:35,877 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:35,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:35,878 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:46:35,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:35,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:35,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-10-10 14:46:35,907 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 14 treesize of output 17 [2018-10-10 14:46:35,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:35,916 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:46:35,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:11 [2018-10-10 14:46:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:36,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:46:36,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-10-10 14:46:36,037 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_28.bpl [2018-10-10 14:46:36,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 14:46:36,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 14:46:36,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:46:36,039 INFO L87 Difference]: Start difference. First operand 390 states and 400 transitions. Second operand 25 states. [2018-10-10 14:46:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:37,810 INFO L93 Difference]: Finished difference Result 449 states and 458 transitions. [2018-10-10 14:46:37,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:46:37,811 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 149 [2018-10-10 14:46:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:37,813 INFO L225 Difference]: With dead ends: 449 [2018-10-10 14:46:37,814 INFO L226 Difference]: Without dead ends: 449 [2018-10-10 14:46:37,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=1685, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 14:46:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-10 14:46:37,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 360. [2018-10-10 14:46:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-10 14:46:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 370 transitions. [2018-10-10 14:46:37,820 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 370 transitions. Word has length 149 [2018-10-10 14:46:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:37,820 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 370 transitions. [2018-10-10 14:46:37,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 14:46:37,820 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 370 transitions. [2018-10-10 14:46:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 14:46:37,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:37,821 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:46:37,822 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:37,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:37,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1720316740, now seen corresponding path program 1 times [2018-10-10 14:46:37,822 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:37,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:37,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:37,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:37,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:39,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:39,258 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:46:39,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:39,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:39,332 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:46:39,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:46:39,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:39,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:39,371 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:46:39,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-10-10 14:46:39,409 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:46:39,411 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 8 treesize of output 7 [2018-10-10 14:46:39,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-10 14:46:39,470 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-10 14:46:39,477 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 12 treesize of output 11 [2018-10-10 14:46:39,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-10 14:46:39,552 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 29 treesize of output 22 [2018-10-10 14:46:39,555 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:39,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-10-10 14:46:39,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-10-10 14:46:39,708 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 25 treesize of output 19 [2018-10-10 14:46:39,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2018-10-10 14:46:39,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:46:39,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:46:39,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:46:39,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:25 [2018-10-10 14:46:39,938 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:39,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-10-10 14:46:39,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:39,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:46:39,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-10-10 14:46:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:40,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:46:40,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 40 [2018-10-10 14:46:40,159 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_29.bpl [2018-10-10 14:46:40,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 14:46:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 14:46:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1542, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 14:46:40,162 INFO L87 Difference]: Start difference. First operand 360 states and 370 transitions. Second operand 41 states. [2018-10-10 14:46:44,200 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2018-10-10 14:46:44,358 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2018-10-10 14:46:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:46:46,776 INFO L93 Difference]: Finished difference Result 440 states and 448 transitions. [2018-10-10 14:46:46,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 14:46:46,777 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 150 [2018-10-10 14:46:46,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:46:46,779 INFO L225 Difference]: With dead ends: 440 [2018-10-10 14:46:46,779 INFO L226 Difference]: Without dead ends: 440 [2018-10-10 14:46:46,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 130 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=819, Invalid=6321, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 14:46:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-10 14:46:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 399. [2018-10-10 14:46:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-10 14:46:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 413 transitions. [2018-10-10 14:46:46,787 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 413 transitions. Word has length 150 [2018-10-10 14:46:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:46:46,787 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 413 transitions. [2018-10-10 14:46:46,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 14:46:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 413 transitions. [2018-10-10 14:46:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-10 14:46:46,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:46:46,789 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:46,789 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:46:46,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:46:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1790211183, now seen corresponding path program 1 times [2018-10-10 14:46:46,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:46:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:46:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:46:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:47,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:46:47,835 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:46:47,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:46:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:46:47,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:46:47,914 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:46:47,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:47,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:47,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:46:48,134 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:48,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:48,136 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:46:48,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:46:48,356 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:46:48,358 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 8 treesize of output 7 [2018-10-10 14:46:48,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,373 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:46:48,375 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:46:48,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-10-10 14:46:48,578 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-10-10 14:46:48,581 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 12 treesize of output 11 [2018-10-10 14:46:48,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,613 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 27 treesize of output 28 [2018-10-10 14:46:48,616 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 12 treesize of output 11 [2018-10-10 14:46:48,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:48,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:25 [2018-10-10 14:46:48,786 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 29 treesize of output 22 [2018-10-10 14:46:48,797 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 28 [2018-10-10 14:46:48,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:46:48,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:46:48,869 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 19 treesize of output 14 [2018-10-10 14:46:48,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-10-10 14:46:48,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:48,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:48,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-10 14:46:48,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:74 [2018-10-10 14:46:49,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2018-10-10 14:46:49,332 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:46:49,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:49,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:49,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 19 [2018-10-10 14:46:49,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-10 14:46:49,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 20 treesize of output 18 [2018-10-10 14:46:49,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-10-10 14:46:49,398 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,404 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,458 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 46 treesize of output 38 [2018-10-10 14:46:49,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-10-10 14:46:49,478 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-10 14:46:49,519 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-10 14:46:49,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 31 [2018-10-10 14:46:49,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:46:49,591 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,599 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 28 [2018-10-10 14:46:49,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:46:49,610 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-10-10 14:46:49,622 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:46:49,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 36 treesize of output 32 [2018-10-10 14:46:49,630 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:46:49,630 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,639 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:49,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-10-10 14:46:49,704 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:78, output treesize:86 [2018-10-10 14:46:50,273 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 19 treesize of output 18 [2018-10-10 14:46:50,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:50,295 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 16 treesize of output 15 [2018-10-10 14:46:50,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:50,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-10 14:46:50,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:34 [2018-10-10 14:46:51,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:46:51,530 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 26 treesize of output 16 [2018-10-10 14:46:51,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:46:51,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:46:51,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:12 [2018-10-10 14:46:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:46:51,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:46:51,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 60 [2018-10-10 14:46:51,744 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_30.bpl [2018-10-10 14:46:51,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 14:46:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 14:46:51,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3493, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 14:46:51,747 INFO L87 Difference]: Start difference. First operand 399 states and 413 transitions. Second operand 61 states. [2018-10-10 14:46:54,074 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2018-10-10 14:46:54,264 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2018-10-10 14:46:54,562 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2018-10-10 14:46:54,803 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2018-10-10 14:46:55,064 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2018-10-10 14:46:55,360 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2018-10-10 14:46:55,629 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2018-10-10 14:46:55,913 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2018-10-10 14:46:56,203 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2018-10-10 14:46:56,465 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2018-10-10 14:46:57,358 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2018-10-10 14:46:57,772 WARN L178 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 69 [2018-10-10 14:46:57,978 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2018-10-10 14:46:58,235 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2018-10-10 14:46:58,456 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-10-10 14:46:58,642 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-10-10 14:46:58,886 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 63 [2018-10-10 14:46:59,217 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2018-10-10 14:46:59,647 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 64 [2018-10-10 14:47:02,084 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2018-10-10 14:47:02,552 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 69 [2018-10-10 14:47:03,198 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 74 [2018-10-10 14:47:03,451 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2018-10-10 14:47:03,852 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 75 [2018-10-10 14:47:04,130 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2018-10-10 14:47:04,388 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 70 [2018-10-10 14:47:04,581 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2018-10-10 14:47:05,048 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 64 [2018-10-10 14:47:05,529 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2018-10-10 14:47:06,392 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-10-10 14:47:06,754 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 63 [2018-10-10 14:47:07,144 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2018-10-10 14:47:07,479 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2018-10-10 14:47:07,761 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2018-10-10 14:47:08,179 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 72 [2018-10-10 14:47:08,656 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-10-10 14:47:08,871 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2018-10-10 14:47:09,089 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-10-10 14:47:09,357 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2018-10-10 14:47:10,650 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2018-10-10 14:47:11,009 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 68 [2018-10-10 14:47:11,317 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-10-10 14:47:12,027 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-10-10 14:47:12,622 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2018-10-10 14:47:13,243 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2018-10-10 14:47:13,580 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 78 [2018-10-10 14:47:13,979 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2018-10-10 14:47:14,288 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2018-10-10 14:47:14,570 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2018-10-10 14:47:14,865 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2018-10-10 14:47:15,257 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-10-10 14:47:15,475 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-10-10 14:47:15,747 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-10-10 14:47:16,071 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-10-10 14:47:16,258 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2018-10-10 14:47:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:47:16,754 INFO L93 Difference]: Finished difference Result 890 states and 913 transitions. [2018-10-10 14:47:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-10 14:47:16,755 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 151 [2018-10-10 14:47:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:47:16,759 INFO L225 Difference]: With dead ends: 890 [2018-10-10 14:47:16,759 INFO L226 Difference]: Without dead ends: 890 [2018-10-10 14:47:16,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6926 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=2722, Invalid=25334, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 14:47:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-10-10 14:47:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 618. [2018-10-10 14:47:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-10 14:47:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 641 transitions. [2018-10-10 14:47:16,773 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 641 transitions. Word has length 151 [2018-10-10 14:47:16,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:47:16,774 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 641 transitions. [2018-10-10 14:47:16,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 14:47:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 641 transitions. [2018-10-10 14:47:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-10 14:47:16,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:47:16,775 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:16,776 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:47:16,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:47:16,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1199294791, now seen corresponding path program 1 times [2018-10-10 14:47:16,776 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:47:16,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:47:16,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:16,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:16,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:47:17,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:47:17,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:47:17,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:47:17,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:47:17,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:47:17,102 INFO L87 Difference]: Start difference. First operand 618 states and 641 transitions. Second operand 15 states. [2018-10-10 14:47:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:47:18,153 INFO L93 Difference]: Finished difference Result 713 states and 733 transitions. [2018-10-10 14:47:18,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:47:18,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 159 [2018-10-10 14:47:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:47:18,157 INFO L225 Difference]: With dead ends: 713 [2018-10-10 14:47:18,157 INFO L226 Difference]: Without dead ends: 713 [2018-10-10 14:47:18,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=433, Invalid=1207, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 14:47:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-10-10 14:47:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 618. [2018-10-10 14:47:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-10 14:47:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 639 transitions. [2018-10-10 14:47:18,166 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 639 transitions. Word has length 159 [2018-10-10 14:47:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:47:18,166 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 639 transitions. [2018-10-10 14:47:18,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:47:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 639 transitions. [2018-10-10 14:47:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-10 14:47:18,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:47:18,167 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,168 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:47:18,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:47:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1476567388, now seen corresponding path program 1 times [2018-10-10 14:47:18,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:47:18,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:47:18,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:18,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:18,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:47:18,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:47:18,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:47:18,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:47:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:47:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:47:18,714 INFO L87 Difference]: Start difference. First operand 618 states and 639 transitions. Second operand 15 states. [2018-10-10 14:47:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:47:20,089 INFO L93 Difference]: Finished difference Result 656 states and 674 transitions. [2018-10-10 14:47:20,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 14:47:20,089 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 160 [2018-10-10 14:47:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:47:20,092 INFO L225 Difference]: With dead ends: 656 [2018-10-10 14:47:20,093 INFO L226 Difference]: Without dead ends: 656 [2018-10-10 14:47:20,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=411, Invalid=1071, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:47:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-10-10 14:47:20,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 618. [2018-10-10 14:47:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-10 14:47:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 637 transitions. [2018-10-10 14:47:20,099 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 637 transitions. Word has length 160 [2018-10-10 14:47:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:47:20,100 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 637 transitions. [2018-10-10 14:47:20,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:47:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 637 transitions. [2018-10-10 14:47:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-10 14:47:20,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:47:20,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,101 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:47:20,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:47:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1655766856, now seen corresponding path program 1 times [2018-10-10 14:47:20,102 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:47:20,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:47:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:20,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:20,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:47:21,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:47:21,160 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:47:21,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:21,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:47:21,242 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:47:21,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:47:21,251 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:47:21,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,261 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:47:21,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:47:21,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:21,305 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:21,305 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:47:21,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:47:21,324 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:47:21,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,334 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:47:21,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-10-10 14:47:21,506 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:47:21,508 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 8 treesize of output 7 [2018-10-10 14:47:21,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,528 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:47:21,535 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:47:21,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-10-10 14:47:21,827 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-10-10 14:47:21,835 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 12 treesize of output 11 [2018-10-10 14:47:21,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,860 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 27 treesize of output 28 [2018-10-10 14:47:21,863 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 12 treesize of output 11 [2018-10-10 14:47:21,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:21,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2018-10-10 14:47:22,084 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 29 treesize of output 22 [2018-10-10 14:47:22,098 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 28 [2018-10-10 14:47:22,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:47:22,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:47:22,149 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 19 treesize of output 14 [2018-10-10 14:47:22,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-10-10 14:47:22,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-10 14:47:22,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:47:22,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-10-10 14:47:22,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:74 [2018-10-10 14:47:22,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 27 [2018-10-10 14:47:22,656 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:47:22,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:47:22,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:47:22,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 20 treesize of output 18 [2018-10-10 14:47:22,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-10-10 14:47:22,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:22,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:22,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 21 treesize of output 19 [2018-10-10 14:47:22,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-10 14:47:22,745 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:22,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:22,787 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 46 treesize of output 38 [2018-10-10 14:47:22,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-10-10 14:47:22,807 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-10 14:47:22,844 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-10-10 14:47:22,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 28 [2018-10-10 14:47:22,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:47:22,923 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-10 14:47:22,934 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:47:22,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 31 [2018-10-10 14:47:22,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:47:22,941 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:22,949 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:22,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 36 treesize of output 32 [2018-10-10 14:47:22,957 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:47:22,958 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:22,966 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:23,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-10-10 14:47:23,026 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:78, output treesize:86 [2018-10-10 14:47:23,845 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 16 treesize of output 15 [2018-10-10 14:47:23,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:23,932 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 19 treesize of output 18 [2018-10-10 14:47:23,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:23,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-10 14:47:23,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:34 [2018-10-10 14:47:24,220 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-10 14:47:24,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:24,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,232 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:24,232 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:47:24,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:24,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:24,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:12 [2018-10-10 14:47:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:47:24,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:47:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 54 [2018-10-10 14:47:24,497 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_33.bpl [2018-10-10 14:47:24,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 14:47:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 14:47:24,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2821, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 14:47:24,499 INFO L87 Difference]: Start difference. First operand 618 states and 637 transitions. Second operand 55 states. [2018-10-10 14:47:26,932 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2018-10-10 14:47:27,206 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-10-10 14:47:27,393 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2018-10-10 14:47:27,572 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2018-10-10 14:47:27,742 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2018-10-10 14:47:28,144 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-10 14:47:28,511 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2018-10-10 14:47:28,678 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2018-10-10 14:47:29,114 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2018-10-10 14:47:29,397 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69 [2018-10-10 14:47:29,728 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2018-10-10 14:47:30,095 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 49 [2018-10-10 14:47:30,363 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 63 [2018-10-10 14:47:30,828 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 68 [2018-10-10 14:47:31,164 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 73 [2018-10-10 14:47:31,489 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 73 [2018-10-10 14:47:31,785 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68 [2018-10-10 14:47:32,116 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63 [2018-10-10 14:47:32,502 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2018-10-10 14:47:33,078 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2018-10-10 14:47:33,335 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2018-10-10 14:47:33,654 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2018-10-10 14:47:33,928 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-10-10 14:47:34,170 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2018-10-10 14:47:34,410 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2018-10-10 14:47:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:47:36,253 INFO L93 Difference]: Finished difference Result 883 states and 909 transitions. [2018-10-10 14:47:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 14:47:36,253 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 163 [2018-10-10 14:47:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:47:36,257 INFO L225 Difference]: With dead ends: 883 [2018-10-10 14:47:36,257 INFO L226 Difference]: Without dead ends: 883 [2018-10-10 14:47:36,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 137 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1135, Invalid=9577, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 14:47:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-10-10 14:47:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 718. [2018-10-10 14:47:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-10-10 14:47:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 741 transitions. [2018-10-10 14:47:36,265 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 741 transitions. Word has length 163 [2018-10-10 14:47:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:47:36,265 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 741 transitions. [2018-10-10 14:47:36,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 14:47:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 741 transitions. [2018-10-10 14:47:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-10 14:47:36,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:47:36,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,267 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:47:36,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:47:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 787813695, now seen corresponding path program 1 times [2018-10-10 14:47:36,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:47:36,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:47:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:37,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:47:37,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:47:37,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-10-10 14:47:37,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 14:47:37,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 14:47:37,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:47:37,383 INFO L87 Difference]: Start difference. First operand 718 states and 741 transitions. Second operand 24 states. [2018-10-10 14:47:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:47:40,382 INFO L93 Difference]: Finished difference Result 771 states and 792 transitions. [2018-10-10 14:47:40,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 14:47:40,386 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2018-10-10 14:47:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:47:40,388 INFO L225 Difference]: With dead ends: 771 [2018-10-10 14:47:40,388 INFO L226 Difference]: Without dead ends: 771 [2018-10-10 14:47:40,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1008, Invalid=4248, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 14:47:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-10-10 14:47:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 718. [2018-10-10 14:47:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-10-10 14:47:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 739 transitions. [2018-10-10 14:47:40,394 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 739 transitions. Word has length 169 [2018-10-10 14:47:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:47:40,395 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 739 transitions. [2018-10-10 14:47:40,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 14:47:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 739 transitions. [2018-10-10 14:47:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-10 14:47:40,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:47:40,396 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:47:40,396 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:47:40,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:47:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1186837132, now seen corresponding path program 1 times [2018-10-10 14:47:40,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:47:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:47:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:40,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-10 14:47:42,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:47:42,193 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:47:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:42,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:47:42,419 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:47:42,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:42,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:42,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:47:42,484 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:47:42,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:42,490 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:47:42,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:47:42,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:42,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:42,582 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:47:42,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:42,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:42,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:47:42,592 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:47:42,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:42,599 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:47:42,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:47:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-10 14:47:42,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:47:42,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [35] total 41 [2018-10-10 14:47:42,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 14:47:42,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 14:47:42,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1581, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 14:47:42,686 INFO L87 Difference]: Start difference. First operand 718 states and 739 transitions. Second operand 42 states. [2018-10-10 14:47:43,555 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-10-10 14:47:44,706 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-10-10 14:47:45,393 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-10-10 14:47:45,687 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-10-10 14:47:48,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:47:48,131 INFO L93 Difference]: Finished difference Result 856 states and 882 transitions. [2018-10-10 14:47:48,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 14:47:48,132 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 174 [2018-10-10 14:47:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:47:48,136 INFO L225 Difference]: With dead ends: 856 [2018-10-10 14:47:48,136 INFO L226 Difference]: Without dead ends: 856 [2018-10-10 14:47:48,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1212, Invalid=6798, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 14:47:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-10 14:47:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 648. [2018-10-10 14:47:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-10-10 14:47:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 667 transitions. [2018-10-10 14:47:48,144 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 667 transitions. Word has length 174 [2018-10-10 14:47:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:47:48,144 INFO L481 AbstractCegarLoop]: Abstraction has 648 states and 667 transitions. [2018-10-10 14:47:48,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 14:47:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 667 transitions. [2018-10-10 14:47:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-10 14:47:48,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:47:48,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:48,146 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:47:48,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:47:48,146 INFO L82 PathProgramCache]: Analyzing trace with hash 336615602, now seen corresponding path program 1 times [2018-10-10 14:47:48,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:47:48,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:47:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:48,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:48,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:47:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:47:49,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:47:49,489 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:47:49,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:47:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:47:49,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:47:49,549 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:47:49,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:47:49,562 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:47:49,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,574 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:47:49,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:47:49,617 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:49,618 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:49,619 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:47:49,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:47:49,638 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:47:49,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,648 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:47:49,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:16 [2018-10-10 14:47:49,697 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:47:49,698 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 8 treesize of output 7 [2018-10-10 14:47:49,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,715 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:47:49,717 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:47:49,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-10-10 14:47:49,825 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-10-10 14:47:49,828 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 12 treesize of output 11 [2018-10-10 14:47:49,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,865 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 27 treesize of output 28 [2018-10-10 14:47:49,868 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 12 treesize of output 11 [2018-10-10 14:47:49,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:49,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:37 [2018-10-10 14:47:49,999 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:50,000 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:50,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-10-10 14:47:50,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:50,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:50,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-10-10 14:47:50,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-10 14:47:50,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:50,137 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:47:50,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:31 [2018-10-10 14:47:50,356 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 29 treesize of output 22 [2018-10-10 14:47:50,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:50,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-10-10 14:47:50,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:50,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:50,387 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 19 treesize of output 14 [2018-10-10 14:47:50,390 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:50,390 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 14 treesize of output 19 [2018-10-10 14:47:50,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:47:50,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:47:50,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:47:50,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:35 [2018-10-10 14:47:50,711 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 25 treesize of output 19 [2018-10-10 14:47:50,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2018-10-10 14:47:50,720 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:47:50,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:47:50,755 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 22 treesize of output 16 [2018-10-10 14:47:50,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:47:50,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 21 [2018-10-10 14:47:50,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-10 14:47:50,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:47:50,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-10-10 14:47:50,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:43 [2018-10-10 14:47:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:47:51,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:47:51,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 54 [2018-10-10 14:47:51,375 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_36.bpl [2018-10-10 14:47:51,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 14:47:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 14:47:51,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2815, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 14:47:51,377 INFO L87 Difference]: Start difference. First operand 648 states and 667 transitions. Second operand 55 states. [2018-10-10 14:47:54,051 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 14:47:54,247 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-10-10 14:47:54,438 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2018-10-10 14:47:54,639 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2018-10-10 14:47:55,054 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-10 14:47:55,230 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-10-10 14:47:55,431 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2018-10-10 14:47:56,915 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-10-10 14:47:57,844 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-10-10 14:47:58,280 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2018-10-10 14:47:59,245 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2018-10-10 14:47:59,490 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2018-10-10 14:47:59,674 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-10-10 14:48:00,326 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2018-10-10 14:48:00,576 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-10-10 14:48:00,768 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-10-10 14:48:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:48:04,249 INFO L93 Difference]: Finished difference Result 916 states and 939 transitions. [2018-10-10 14:48:04,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 14:48:04,249 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 175 [2018-10-10 14:48:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:48:04,252 INFO L225 Difference]: With dead ends: 916 [2018-10-10 14:48:04,252 INFO L226 Difference]: Without dead ends: 916 [2018-10-10 14:48:04,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4092 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1404, Invalid=15108, Unknown=0, NotChecked=0, Total=16512 [2018-10-10 14:48:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-10 14:48:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 671. [2018-10-10 14:48:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-10 14:48:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 693 transitions. [2018-10-10 14:48:04,261 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 693 transitions. Word has length 175 [2018-10-10 14:48:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:48:04,262 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 693 transitions. [2018-10-10 14:48:04,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 14:48:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 693 transitions. [2018-10-10 14:48:04,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-10 14:48:04,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:48:04,263 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:04,263 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:48:04,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:48:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1012559573, now seen corresponding path program 1 times [2018-10-10 14:48:04,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:48:04,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:48:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:48:04,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:48:04,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:48:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:48:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:48:06,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:48:06,010 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:48:06,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:48:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:48:06,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:48:06,095 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:48:06,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:48:06,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:06,345 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:06,346 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:48:06,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-10-10 14:48:06,387 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:48:06,389 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 8 treesize of output 7 [2018-10-10 14:48:06,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-10 14:48:06,427 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-10 14:48:06,429 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 12 treesize of output 11 [2018-10-10 14:48:06,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-10-10 14:48:06,511 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:06,512 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:06,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-10-10 14:48:06,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-10-10 14:48:06,747 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 39 treesize of output 30 [2018-10-10 14:48:06,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:06,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-10-10 14:48:06,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:06,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-10-10 14:48:07,286 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 55 treesize of output 41 [2018-10-10 14:48:07,287 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:48:07,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2018-10-10 14:48:07,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:07,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:07,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:07,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:22 [2018-10-10 14:48:07,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:07,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:48:07,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:07,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:48:07,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-10-10 14:48:07,965 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:07,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:07,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-10-10 14:48:07,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:07,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:48:07,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-10-10 14:48:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:48:08,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:48:08,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 67 [2018-10-10 14:48:08,267 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_37.bpl [2018-10-10 14:48:08,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 14:48:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 14:48:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=4303, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 14:48:08,269 INFO L87 Difference]: Start difference. First operand 671 states and 693 transitions. Second operand 68 states. [2018-10-10 14:48:12,212 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2018-10-10 14:48:12,559 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-10 14:48:12,837 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2018-10-10 14:48:13,067 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2018-10-10 14:48:13,236 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-10-10 14:48:13,829 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2018-10-10 14:48:14,106 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2018-10-10 14:48:14,500 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2018-10-10 14:48:14,880 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-10-10 14:48:15,207 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 67 [2018-10-10 14:48:15,387 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-10-10 14:48:15,654 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2018-10-10 14:48:15,855 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2018-10-10 14:48:16,003 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-10-10 14:48:16,216 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-10-10 14:48:16,431 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-10-10 14:48:16,770 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-10 14:48:17,009 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-10-10 14:48:17,209 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2018-10-10 14:48:17,456 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2018-10-10 14:48:17,718 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2018-10-10 14:48:17,995 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2018-10-10 14:48:18,260 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2018-10-10 14:48:18,530 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-10-10 14:48:18,811 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2018-10-10 14:48:19,100 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-10-10 14:48:19,450 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-10-10 14:48:20,057 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-10-10 14:48:20,432 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2018-10-10 14:48:20,848 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-10-10 14:48:21,179 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-10-10 14:48:21,539 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2018-10-10 14:48:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:48:23,821 INFO L93 Difference]: Finished difference Result 760 states and 779 transitions. [2018-10-10 14:48:23,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 14:48:23,821 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 181 [2018-10-10 14:48:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:48:23,825 INFO L225 Difference]: With dead ends: 760 [2018-10-10 14:48:23,825 INFO L226 Difference]: Without dead ends: 760 [2018-10-10 14:48:23,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 149 SyntacticMatches, 9 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5955 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=2232, Invalid=18938, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 14:48:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-10 14:48:23,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 623. [2018-10-10 14:48:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-10 14:48:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 641 transitions. [2018-10-10 14:48:23,832 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 641 transitions. Word has length 181 [2018-10-10 14:48:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:48:23,833 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 641 transitions. [2018-10-10 14:48:23,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 14:48:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 641 transitions. [2018-10-10 14:48:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 14:48:23,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:48:23,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,835 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:48:23,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:48:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash 584330577, now seen corresponding path program 1 times [2018-10-10 14:48:23,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:48:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:48:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:48:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:48:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:48:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:48:24,508 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-10 14:48:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:48:26,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:48:26,106 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:48:26,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:48:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:48:26,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:48:26,213 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:48:26,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:48:26,353 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:48:26,356 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:48:26,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,380 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:48:26,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:48:26,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:48:26,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:44 [2018-10-10 14:48:26,620 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:26,621 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:26,622 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:48:26,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2018-10-10 14:48:26,734 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:48:26,737 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 8 treesize of output 7 [2018-10-10 14:48:26,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,763 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 24 [2018-10-10 14:48:26,765 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:48:26,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:26,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-10-10 14:48:26,938 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-10-10 14:48:26,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2018-10-10 14:48:26,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:48:26,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:48:27,012 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 72 treesize of output 59 [2018-10-10 14:48:27,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:27,025 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 2 case distinctions, treesize of input 18 treesize of output 27 [2018-10-10 14:48:27,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-10 14:48:27,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:48:27,052 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:27,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-10-10 14:48:27,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-10-10 14:48:27,056 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,067 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:48:27,104 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:80, output treesize:81 [2018-10-10 14:48:27,444 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 49 treesize of output 42 [2018-10-10 14:48:27,453 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2018-10-10 14:48:27,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:48:27,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:48:27,540 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 40 treesize of output 35 [2018-10-10 14:48:27,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-10-10 14:48:27,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,558 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 45 treesize of output 40 [2018-10-10 14:48:27,561 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:27,563 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 14 treesize of output 19 [2018-10-10 14:48:27,564 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,636 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-10-10 14:48:27,647 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2018-10-10 14:48:27,648 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:48:27,685 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:48:27,767 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 54 treesize of output 49 [2018-10-10 14:48:27,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-10-10 14:48:27,772 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,785 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,791 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 71 treesize of output 66 [2018-10-10 14:48:27,794 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:27,796 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 14 treesize of output 19 [2018-10-10 14:48:27,797 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,814 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:27,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-10-10 14:48:27,882 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:125, output treesize:147 [2018-10-10 14:48:29,785 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 54 treesize of output 53 [2018-10-10 14:48:29,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:29,911 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 80 treesize of output 79 [2018-10-10 14:48:29,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:29,989 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 39 treesize of output 38 [2018-10-10 14:48:29,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:30,073 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 53 treesize of output 52 [2018-10-10 14:48:30,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:30,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-1 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-10-10 14:48:30,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:227, output treesize:223 [2018-10-10 14:48:30,875 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-10 14:48:30,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:30,939 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:30,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:30,941 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 53 treesize of output 47 [2018-10-10 14:48:30,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:30,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:30,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:30,987 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 79 treesize of output 73 [2018-10-10 14:48:30,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:31,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-10-10 14:48:31,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:255, output treesize:121 [2018-10-10 14:48:31,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2018-10-10 14:48:31,756 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 42 treesize of output 34 [2018-10-10 14:48:31,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:31,816 INFO L682 Elim1Store]: detected equality via solver [2018-10-10 14:48:31,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-10-10 14:48:31,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:31,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:31,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-10-10 14:48:31,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:31,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:48:31,880 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 20 treesize of output 16 [2018-10-10 14:48:31,880 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:31,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 7 treesize of output 1 [2018-10-10 14:48:31,895 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:31,907 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:31,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-10 14:48:31,942 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:151, output treesize:79 [2018-10-10 14:48:32,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-10 14:48:32,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 5 [2018-10-10 14:48:32,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:32,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-10 14:48:32,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-10 14:48:32,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:32,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:48:32,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2018-10-10 14:48:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:48:32,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:48:32,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 42] total 63 [2018-10-10 14:48:32,996 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/dll_extends_pointer_true-valid-memsafety.i_38.bpl [2018-10-10 14:48:32,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 14:48:32,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 14:48:32,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3728, Unknown=9, NotChecked=0, Total=3906 [2018-10-10 14:48:32,998 INFO L87 Difference]: Start difference. First operand 623 states and 641 transitions. Second operand 63 states. [2018-10-10 14:48:37,427 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-10-10 14:48:37,974 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 61 [2018-10-10 14:48:38,333 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 66 [2018-10-10 14:48:38,673 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 74 [2018-10-10 14:48:38,864 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2018-10-10 14:48:39,102 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2018-10-10 14:48:39,389 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2018-10-10 14:48:39,622 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2018-10-10 14:48:39,854 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 54 [2018-10-10 14:48:40,307 WARN L178 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 81 [2018-10-10 14:48:40,834 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 83 [2018-10-10 14:48:41,115 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2018-10-10 14:48:41,389 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2018-10-10 14:48:41,653 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2018-10-10 14:48:42,104 WARN L178 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 86 [2018-10-10 14:48:42,736 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 81 [2018-10-10 14:48:43,503 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 87 [2018-10-10 14:48:43,879 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 72 [2018-10-10 14:48:44,405 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 76 [2018-10-10 14:48:44,974 WARN L178 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 84 [2018-10-10 14:48:45,238 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 76 [2018-10-10 14:48:45,667 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 86 [2018-10-10 14:48:46,393 WARN L178 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 92 [2018-10-10 14:48:46,857 WARN L178 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 91 [2018-10-10 14:48:47,510 WARN L178 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 96 [2018-10-10 14:48:47,800 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2018-10-10 14:48:48,475 WARN L178 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 98 [2018-10-10 14:48:48,814 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2018-10-10 14:48:49,445 WARN L178 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 93 [2018-10-10 14:48:49,685 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 71 [2018-10-10 14:48:50,032 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2018-10-10 14:48:50,357 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 67 [2018-10-10 14:48:50,859 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 90 [2018-10-10 14:48:51,203 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2018-10-10 14:48:51,567 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2018-10-10 14:48:51,915 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 74 [2018-10-10 14:48:52,521 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 85 [2018-10-10 14:48:53,112 WARN L178 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 89 [2018-10-10 14:48:53,774 WARN L178 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 93 [2018-10-10 14:48:55,018 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 100 [2018-10-10 14:48:55,902 WARN L178 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 88 [2018-10-10 14:48:56,598 WARN L178 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 127 [2018-10-10 14:48:57,187 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 102 [2018-10-10 14:48:57,875 WARN L178 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 107 [2018-10-10 14:48:58,440 WARN L178 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 86 [2018-10-10 14:49:00,782 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 54 [2018-10-10 14:49:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:49:02,054 INFO L93 Difference]: Finished difference Result 956 states and 975 transitions. [2018-10-10 14:49:02,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-10 14:49:02,055 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 182 [2018-10-10 14:49:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:49:02,059 INFO L225 Difference]: With dead ends: 956 [2018-10-10 14:49:02,059 INFO L226 Difference]: Without dead ends: 956 [2018-10-10 14:49:02,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 148 SyntacticMatches, 10 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6509 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=1837, Invalid=22016, Unknown=17, NotChecked=0, Total=23870 [2018-10-10 14:49:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-10-10 14:49:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 798. [2018-10-10 14:49:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2018-10-10 14:49:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 819 transitions. [2018-10-10 14:49:02,067 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 819 transitions. Word has length 182 [2018-10-10 14:49:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:49:02,067 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 819 transitions. [2018-10-10 14:49:02,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 14:49:02,067 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 819 transitions. [2018-10-10 14:49:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-10 14:49:02,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:49:02,068 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:02,069 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:49:02,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:49:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash 714990376, now seen corresponding path program 2 times [2018-10-10 14:49:02,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:49:02,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:49:02,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:02,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:49:02,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:49:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:49:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:49:03,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:49:03,761 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:49:03,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:49:03,832 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:49:03,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:49:03,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:49:04,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:49:04,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 25 [2018-10-10 14:49:04,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:25 [2018-10-10 14:49:04,485 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:49:04,486 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 8 treesize of output 7 [2018-10-10 14:49:04,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-10-10 14:49:04,701 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-10-10 14:49:04,704 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 12 treesize of output 11 [2018-10-10 14:49:04,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:40 [2018-10-10 14:49:04,941 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 38 treesize of output 29 [2018-10-10 14:49:04,944 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:49:04,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2018-10-10 14:49:04,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:49:04,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:37 [2018-10-10 14:49:05,248 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 34 treesize of output 26 [2018-10-10 14:49:05,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 23 [2018-10-10 14:49:05,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:49:05,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:49:05,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-10 14:49:05,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:55 [2018-10-10 14:49:05,790 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:49:05,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-10-10 14:49:05,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:49:05,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:49:05,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-10-10 14:49:06,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:49:06,144 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:49:06,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-10-10 14:49:06,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:49:06,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:49:06,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2018-10-10 14:49:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:49:06,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:49:06,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 62 [2018-10-10 14:49:06,989 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:49:06,993 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:49:06,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:49:06 BoogieIcfgContainer [2018-10-10 14:49:06,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:49:06,994 INFO L168 Benchmark]: Toolchain (without parser) took 207853.13 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 875.0 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -202.4 MB). Peak memory consumption was 672.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:06,994 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:49:06,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 567.05 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:49:06,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.73 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:49:06,995 INFO L168 Benchmark]: Boogie Preprocessor took 144.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.5 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:06,996 INFO L168 Benchmark]: RCFGBuilder took 1070.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:06,996 INFO L168 Benchmark]: TraceAbstraction took 206005.22 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 168.8 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 510.2 MB). Peak memory consumption was 679.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:49:06,998 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 567.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.73 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 144.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.5 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1070.45 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 51.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206005.22 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 168.8 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 510.2 MB). Peak memory consumption was 679.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 39). - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 39). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 216 locations, 25 error locations. TIMEOUT Result, 205.9s OverallTime, 39 OverallIterations, 3 TraceHistogramMax, 151.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6389 SDtfs, 48728 SDslu, 61027 SDs, 0 SdLazy, 55203 SolverSat, 2891 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 51.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3601 GetRequests, 1805 SyntacticMatches, 90 SemanticMatches, 1706 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 37264 ImplicationChecksByTransitivity, 126.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=38, 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.3s AutomataMinimizationTime, 38 MinimizatonAttempts, 4601 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 45.3s InterpolantComputationTime, 6278 NumberOfCodeBlocks, 6278 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 6227 ConstructedInterpolants, 299 QuantifiedInterpolants, 11630829 SizeOfPredicates, 505 NumberOfNonLiveVariables, 4271 ConjunctsInSsa, 803 ConjunctsInUnsatCore, 51 InterpolantComputations, 26 PerfectInterpolantSequences, 168/559 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...