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/memory-alloca/c.03-alloca_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:52:45,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:52:45,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:52:45,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:52:45,379 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:52:45,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:52:45,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:52:45,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:52:45,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:52:45,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:52:45,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:52:45,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:52:45,399 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:52:45,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:52:45,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:52:45,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:52:45,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:52:45,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:52:45,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:52:45,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:52:45,418 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:52:45,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:52:45,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:52:45,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:52:45,425 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:52:45,427 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:52:45,428 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:52:45,429 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:52:45,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:52:45,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:52:45,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:52:45,433 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:52:45,435 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:52:45,435 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:52:45,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:52:45,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:52:45,438 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:52:45,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:52:45,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:52:45,457 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:52:45,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:52:45,457 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:52:45,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:52:45,458 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:52:45,458 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:52:45,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:52:45,458 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:52:45,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:52:45,459 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:52:45,459 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:52:45,459 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:52:45,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:52:45,459 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:52:45,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:52:45,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:52:45,460 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:52:45,460 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:52:45,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:52:45,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:52:45,461 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:52:45,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:52:45,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:52:45,461 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:52:45,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:52:45,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:52:45,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:52:45,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:52:45,544 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:52:45,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-10-10 14:52:45,867 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f585050f7/186c1b2b94bd453d87dab5f03ec8d9c8/FLAGe815130f6 [2018-10-10 14:52:46,161 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:52:46,162 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-10-10 14:52:46,180 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f585050f7/186c1b2b94bd453d87dab5f03ec8d9c8/FLAGe815130f6 [2018-10-10 14:52:46,197 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f585050f7/186c1b2b94bd453d87dab5f03ec8d9c8 [2018-10-10 14:52:46,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:52:46,209 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:52:46,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:46,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:52:46,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:52:46,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56522f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46, skipping insertion in model container [2018-10-10 14:52:46,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:52:46,277 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:52:46,503 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:46,518 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:52:46,609 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:46,688 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:52:46,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46 WrapperNode [2018-10-10 14:52:46,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:46,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:46,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:52:46,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:52:46,700 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:52:46" (1/1) ... [2018-10-10 14:52:46,725 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:52:46" (1/1) ... [2018-10-10 14:52:46,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:46,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:52:46,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:52:46,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:52:46,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (1/1) ... [2018-10-10 14:52:46,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:52:46,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:52:46,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:52:46,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:52:46,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (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:52:46,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:52:46,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:52:48,289 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:52:48,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:48 BoogieIcfgContainer [2018-10-10 14:52:48,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:52:48,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:52:48,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:52:48,294 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:52:48,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:52:46" (1/3) ... [2018-10-10 14:52:48,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44910081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:48, skipping insertion in model container [2018-10-10 14:52:48,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:46" (2/3) ... [2018-10-10 14:52:48,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44910081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:48, skipping insertion in model container [2018-10-10 14:52:48,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:48" (3/3) ... [2018-10-10 14:52:48,298 INFO L112 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-10-10 14:52:48,307 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:52:48,315 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-10-10 14:52:48,332 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-10-10 14:52:48,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:52:48,361 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:52:48,361 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:52:48,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:52:48,362 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:52:48,362 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:52:48,362 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:52:48,362 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:52:48,363 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:52:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states. [2018-10-10 14:52:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 14:52:48,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:48,403 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] [2018-10-10 14:52:48,406 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:48,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1822215545, now seen corresponding path program 1 times [2018-10-10 14:52:48,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:48,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:48,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:49,182 WARN L178 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-10 14:52:49,417 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:52:49,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:49,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:52:49,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:49,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:49,450 INFO L87 Difference]: Start difference. First operand 309 states. Second operand 9 states. [2018-10-10 14:52:49,867 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:52:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:51,330 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-10-10 14:52:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:52:51,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-10-10 14:52:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:51,355 INFO L225 Difference]: With dead ends: 307 [2018-10-10 14:52:51,355 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 14:52:51,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:52:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 14:52:51,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-10-10 14:52:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-10 14:52:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 303 transitions. [2018-10-10 14:52:51,427 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 303 transitions. Word has length 74 [2018-10-10 14:52:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:51,428 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 303 transitions. [2018-10-10 14:52:51,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 303 transitions. [2018-10-10 14:52:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:52:51,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:51,431 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:52:51,433 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:51,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -654106940, now seen corresponding path program 1 times [2018-10-10 14:52:51,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:51,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:51,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:51,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:52,161 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:52:52,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:52,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:52:52,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:52:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:52:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:52:52,165 INFO L87 Difference]: Start difference. First operand 302 states and 303 transitions. Second operand 17 states. [2018-10-10 14:52:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:54,033 INFO L93 Difference]: Finished difference Result 315 states and 316 transitions. [2018-10-10 14:52:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:52:54,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 75 [2018-10-10 14:52:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:54,038 INFO L225 Difference]: With dead ends: 315 [2018-10-10 14:52:54,038 INFO L226 Difference]: Without dead ends: 315 [2018-10-10 14:52:54,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:52:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-10 14:52:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 300. [2018-10-10 14:52:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-10 14:52:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2018-10-10 14:52:54,057 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 75 [2018-10-10 14:52:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:54,058 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2018-10-10 14:52:54,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:52:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2018-10-10 14:52:54,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:52:54,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:54,061 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] [2018-10-10 14:52:54,062 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:54,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2075201363, now seen corresponding path program 1 times [2018-10-10 14:52:54,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:54,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:54,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:54,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:54,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:52:54,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:52:54,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:54,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:54,359 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand 9 states. [2018-10-10 14:52:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:54,945 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-10-10 14:52:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:52:54,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-10-10 14:52:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:54,950 INFO L225 Difference]: With dead ends: 299 [2018-10-10 14:52:54,951 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 14:52:54,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:52:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 14:52:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-10 14:52:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-10 14:52:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-10-10 14:52:54,965 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 84 [2018-10-10 14:52:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:54,966 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-10-10 14:52:54,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-10-10 14:52:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 14:52:54,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:54,968 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:52:54,969 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:54,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:54,970 INFO L82 PathProgramCache]: Analyzing trace with hash 93267306, now seen corresponding path program 1 times [2018-10-10 14:52:54,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:54,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:55,367 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:52:55,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:55,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:52:55,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:52:55,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:52:55,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:52:55,369 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 15 states. [2018-10-10 14:52:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:56,828 INFO L93 Difference]: Finished difference Result 298 states and 299 transitions. [2018-10-10 14:52:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:52:56,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 85 [2018-10-10 14:52:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:56,834 INFO L225 Difference]: With dead ends: 298 [2018-10-10 14:52:56,834 INFO L226 Difference]: Without dead ends: 298 [2018-10-10 14:52:56,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:52:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-10 14:52:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-10-10 14:52:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-10 14:52:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2018-10-10 14:52:56,870 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 85 [2018-10-10 14:52:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:56,871 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2018-10-10 14:52:56,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:52:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2018-10-10 14:52:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:52:56,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:56,873 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] [2018-10-10 14:52:56,874 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:56,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 926940883, now seen corresponding path program 1 times [2018-10-10 14:52:56,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:57,014 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:52:57,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:52:57,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:52:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:52:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:57,016 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand 8 states. [2018-10-10 14:52:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:57,565 INFO L93 Difference]: Finished difference Result 296 states and 297 transitions. [2018-10-10 14:52:57,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:52:57,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-10-10 14:52:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:57,568 INFO L225 Difference]: With dead ends: 296 [2018-10-10 14:52:57,569 INFO L226 Difference]: Without dead ends: 296 [2018-10-10 14:52:57,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:52:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-10 14:52:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-10-10 14:52:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-10 14:52:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 297 transitions. [2018-10-10 14:52:57,576 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 297 transitions. Word has length 94 [2018-10-10 14:52:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:57,576 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 297 transitions. [2018-10-10 14:52:57,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:52:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 297 transitions. [2018-10-10 14:52:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:52:57,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:57,578 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] [2018-10-10 14:52:57,579 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:57,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1329603568, now seen corresponding path program 1 times [2018-10-10 14:52:57,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:57,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:57,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:57,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:57,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:57,789 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:52:57,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:57,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:52:57,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:52:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:52:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:52:57,790 INFO L87 Difference]: Start difference. First operand 296 states and 297 transitions. Second operand 12 states. [2018-10-10 14:52:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:58,764 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-10-10 14:52:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:52:58,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2018-10-10 14:52:58,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:58,768 INFO L225 Difference]: With dead ends: 309 [2018-10-10 14:52:58,768 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 14:52:58,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:52:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 14:52:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 294. [2018-10-10 14:52:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-10 14:52:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-10 14:52:58,776 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 95 [2018-10-10 14:52:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:58,776 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-10 14:52:58,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:52:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-10 14:52:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 14:52:58,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:58,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, 1, 1, 1, 1, 1] [2018-10-10 14:52:58,779 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:58,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash 567434489, now seen corresponding path program 1 times [2018-10-10 14:52:58,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:58,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:58,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:58,952 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:52:58,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:58,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:52:58,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:52:58,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:52:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:52:58,954 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 6 states. [2018-10-10 14:52:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:59,241 INFO L93 Difference]: Finished difference Result 292 states and 293 transitions. [2018-10-10 14:52:59,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:52:59,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-10-10 14:52:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:59,246 INFO L225 Difference]: With dead ends: 292 [2018-10-10 14:52:59,246 INFO L226 Difference]: Without dead ends: 292 [2018-10-10 14:52:59,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:59,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-10 14:52:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-10-10 14:52:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-10 14:52:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 293 transitions. [2018-10-10 14:52:59,252 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 293 transitions. Word has length 104 [2018-10-10 14:52:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:59,252 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 293 transitions. [2018-10-10 14:52:59,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:52:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 293 transitions. [2018-10-10 14:52:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 14:52:59,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:59,254 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] [2018-10-10 14:52:59,255 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:59,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 410600118, now seen corresponding path program 1 times [2018-10-10 14:52:59,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:59,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:59,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:59,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:59,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:59,923 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:52:59,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:59,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:52:59,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:52:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:52:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:59,925 INFO L87 Difference]: Start difference. First operand 292 states and 293 transitions. Second operand 8 states. [2018-10-10 14:53:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:00,357 INFO L93 Difference]: Finished difference Result 290 states and 291 transitions. [2018-10-10 14:53:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:53:00,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-10-10 14:53:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:00,360 INFO L225 Difference]: With dead ends: 290 [2018-10-10 14:53:00,360 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 14:53:00,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:53:00,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 14:53:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-10-10 14:53:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-10 14:53:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2018-10-10 14:53:00,367 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 105 [2018-10-10 14:53:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:00,367 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2018-10-10 14:53:00,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:53:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2018-10-10 14:53:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 14:53:00,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:00,369 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, 1, 1, 1] [2018-10-10 14:53:00,370 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:00,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:00,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1721989056, now seen corresponding path program 1 times [2018-10-10 14:53:00,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:00,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:00,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:00,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:00,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:00,479 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:53:00,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:00,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:53:00,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:53:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:53:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:53:00,481 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 6 states. [2018-10-10 14:53:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:00,760 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-10-10 14:53:00,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:53:00,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2018-10-10 14:53:00,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:00,764 INFO L225 Difference]: With dead ends: 305 [2018-10-10 14:53:00,764 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 14:53:00,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:53:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 14:53:00,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 287. [2018-10-10 14:53:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-10 14:53:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-10 14:53:00,770 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 114 [2018-10-10 14:53:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:00,771 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-10 14:53:00,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:53:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-10 14:53:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 14:53:00,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:00,772 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, 1, 1, 1, 1] [2018-10-10 14:53:00,773 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:00,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1842053343, now seen corresponding path program 1 times [2018-10-10 14:53:00,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:00,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:00,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:00,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:00,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:01,018 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:53:01,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:01,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:53:01,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:53:01,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:53:01,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:53:01,020 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 9 states. [2018-10-10 14:53:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:01,543 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-10-10 14:53:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:53:01,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-10-10 14:53:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:01,546 INFO L225 Difference]: With dead ends: 299 [2018-10-10 14:53:01,546 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 14:53:01,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:53:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 14:53:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 284. [2018-10-10 14:53:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-10 14:53:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 285 transitions. [2018-10-10 14:53:01,552 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 285 transitions. Word has length 115 [2018-10-10 14:53:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:01,553 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 285 transitions. [2018-10-10 14:53:01,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:53:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 285 transitions. [2018-10-10 14:53:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 14:53:01,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:01,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:53:01,555 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:01,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 61645606, now seen corresponding path program 1 times [2018-10-10 14:53:01,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:01,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:01,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:01,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:01,676 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:53:01,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:01,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:53:01,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:53:01,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:53:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:53:01,678 INFO L87 Difference]: Start difference. First operand 284 states and 285 transitions. Second operand 6 states. [2018-10-10 14:53:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:01,913 INFO L93 Difference]: Finished difference Result 286 states and 287 transitions. [2018-10-10 14:53:01,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:53:01,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-10-10 14:53:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:01,915 INFO L225 Difference]: With dead ends: 286 [2018-10-10 14:53:01,915 INFO L226 Difference]: Without dead ends: 286 [2018-10-10 14:53:01,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:53:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-10 14:53:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2018-10-10 14:53:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 14:53:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-10-10 14:53:01,921 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 124 [2018-10-10 14:53:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:01,921 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-10-10 14:53:01,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:53:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-10-10 14:53:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 14:53:01,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:01,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:53:01,924 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:01,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1911013957, now seen corresponding path program 1 times [2018-10-10 14:53:01,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:01,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:01,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:01,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:02,405 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:53:02,485 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:53:02,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:02,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:53:02,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:53:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:53:02,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:53:02,486 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 9 states. [2018-10-10 14:53:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:04,357 INFO L93 Difference]: Finished difference Result 282 states and 283 transitions. [2018-10-10 14:53:04,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:53:04,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-10-10 14:53:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:04,360 INFO L225 Difference]: With dead ends: 282 [2018-10-10 14:53:04,360 INFO L226 Difference]: Without dead ends: 282 [2018-10-10 14:53:04,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:53:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-10 14:53:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-10-10 14:53:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 14:53:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 283 transitions. [2018-10-10 14:53:04,368 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 283 transitions. Word has length 125 [2018-10-10 14:53:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:04,368 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 283 transitions. [2018-10-10 14:53:04,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:53:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 283 transitions. [2018-10-10 14:53:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 14:53:04,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:04,370 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, 1, 1, 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:53:04,371 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:04,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -843828608, now seen corresponding path program 1 times [2018-10-10 14:53:04,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:04,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:04,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:04,687 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:53:04,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:04,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:53:04,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:53:04,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:53:04,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:53:04,689 INFO L87 Difference]: Start difference. First operand 282 states and 283 transitions. Second operand 6 states. [2018-10-10 14:53:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:05,070 INFO L93 Difference]: Finished difference Result 283 states and 284 transitions. [2018-10-10 14:53:05,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:53:05,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-10-10 14:53:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:05,073 INFO L225 Difference]: With dead ends: 283 [2018-10-10 14:53:05,073 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 14:53:05,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:53:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 14:53:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 280. [2018-10-10 14:53:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-10 14:53:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-10-10 14:53:05,081 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 137 [2018-10-10 14:53:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:05,081 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-10-10 14:53:05,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:53:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-10-10 14:53:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 14:53:05,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:05,082 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, 1, 1, 1, 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:53:05,083 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:05,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:05,085 INFO L82 PathProgramCache]: Analyzing trace with hash -388882768, now seen corresponding path program 1 times [2018-10-10 14:53:05,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:05,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:05,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:05,324 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:53:05,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:05,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:53:05,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:53:05,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:53:05,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:53:05,326 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 8 states. [2018-10-10 14:53:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:05,684 INFO L93 Difference]: Finished difference Result 281 states and 282 transitions. [2018-10-10 14:53:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:53:05,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 138 [2018-10-10 14:53:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:05,687 INFO L225 Difference]: With dead ends: 281 [2018-10-10 14:53:05,687 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 14:53:05,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:53:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 14:53:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2018-10-10 14:53:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-10 14:53:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 279 transitions. [2018-10-10 14:53:05,693 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 279 transitions. Word has length 138 [2018-10-10 14:53:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:05,694 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 279 transitions. [2018-10-10 14:53:05,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:53:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 279 transitions. [2018-10-10 14:53:05,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 14:53:05,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:05,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:05,696 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:05,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:05,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1348768530, now seen corresponding path program 1 times [2018-10-10 14:53:05,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:05,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:05,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:05,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:05,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:05,816 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:53:05,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:05,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:53:05,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:53:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:53:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:53:05,818 INFO L87 Difference]: Start difference. First operand 278 states and 279 transitions. Second operand 6 states. [2018-10-10 14:53:06,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:06,508 INFO L93 Difference]: Finished difference Result 292 states and 293 transitions. [2018-10-10 14:53:06,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:53:06,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-10-10 14:53:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:06,512 INFO L225 Difference]: With dead ends: 292 [2018-10-10 14:53:06,512 INFO L226 Difference]: Without dead ends: 292 [2018-10-10 14:53:06,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:53:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-10 14:53:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 276. [2018-10-10 14:53:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 14:53:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-10-10 14:53:06,517 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 147 [2018-10-10 14:53:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:06,517 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-10-10 14:53:06,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:53:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-10-10 14:53:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-10 14:53:06,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:06,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:06,520 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:06,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1137848326, now seen corresponding path program 1 times [2018-10-10 14:53:06,520 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:06,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:06,689 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:53:06,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:06,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:53:06,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:53:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:53:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:53:06,691 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 9 states. [2018-10-10 14:53:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:07,077 INFO L93 Difference]: Finished difference Result 287 states and 288 transitions. [2018-10-10 14:53:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:53:07,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-10-10 14:53:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:07,080 INFO L225 Difference]: With dead ends: 287 [2018-10-10 14:53:07,080 INFO L226 Difference]: Without dead ends: 287 [2018-10-10 14:53:07,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:53:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-10 14:53:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 274. [2018-10-10 14:53:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-10 14:53:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 275 transitions. [2018-10-10 14:53:07,086 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 275 transitions. Word has length 148 [2018-10-10 14:53:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:07,086 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 275 transitions. [2018-10-10 14:53:07,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:53:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 275 transitions. [2018-10-10 14:53:07,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-10 14:53:07,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:07,088 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,089 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:07,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:07,090 INFO L82 PathProgramCache]: Analyzing trace with hash -225447910, now seen corresponding path program 1 times [2018-10-10 14:53:07,090 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:07,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:07,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:07,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:08,146 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 13 [2018-10-10 14:53:11,905 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:53:11,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:11,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-10-10 14:53:11,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 14:53:11,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 14:53:11,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=810, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:53:11,907 INFO L87 Difference]: Start difference. First operand 274 states and 275 transitions. Second operand 30 states. [2018-10-10 14:53:14,930 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2018-10-10 14:53:15,321 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-10 14:53:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:16,603 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2018-10-10 14:53:16,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 14:53:16,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 183 [2018-10-10 14:53:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:16,605 INFO L225 Difference]: With dead ends: 273 [2018-10-10 14:53:16,605 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 14:53:16,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=280, Invalid=4010, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 14:53:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 14:53:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 14:53:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 14:53:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 14:53:16,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2018-10-10 14:53:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:16,609 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 14:53:16,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 14:53:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 14:53:16,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 14:53:16,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:53:16 BoogieIcfgContainer [2018-10-10 14:53:16,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:53:16,616 INFO L168 Benchmark]: Toolchain (without parser) took 30408.04 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -622.2 MB). Peak memory consumption was 466.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:16,617 INFO L168 Benchmark]: CDTParser took 1.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:53:16,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.37 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:53:16,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.45 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:53:16,619 INFO L168 Benchmark]: Boogie Preprocessor took 125.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:16,620 INFO L168 Benchmark]: RCFGBuilder took 1396.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:16,621 INFO L168 Benchmark]: TraceAbstraction took 28324.39 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 356.5 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 108.0 MB). Peak memory consumption was 464.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:16,625 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 479.37 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 77.45 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 125.40 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 732.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1396.40 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 66.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28324.39 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 356.5 MB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 108.0 MB). Peak memory consumption was 464.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 309 locations, 31 error locations. SAFE Result, 28.2s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3638 SDtfs, 16681 SDslu, 11993 SDs, 0 SdLazy, 7342 SolverSat, 312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 55 SyntacticMatches, 17 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1947 NumberOfCodeBlocks, 1947 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1930 ConstructedInterpolants, 0 QuantifiedInterpolants, 1704928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...