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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 11:25:44,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 11:25:44,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 11:25:44,412 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 11:25:44,413 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 11:25:44,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 11:25:44,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 11:25:44,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 11:25:44,421 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 11:25:44,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 11:25:44,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 11:25:44,423 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 11:25:44,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 11:25:44,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 11:25:44,426 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 11:25:44,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 11:25:44,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 11:25:44,430 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 11:25:44,432 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 11:25:44,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 11:25:44,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 11:25:44,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 11:25:44,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 11:25:44,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 11:25:44,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 11:25:44,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 11:25:44,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 11:25:44,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 11:25:44,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 11:25:44,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 11:25:44,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 11:25:44,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 11:25:44,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 11:25:44,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 11:25:44,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 11:25:44,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 11:25:44,450 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 11:25:44,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 11:25:44,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 11:25:44,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 11:25:44,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 11:25:44,483 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 11:25:44,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 11:25:44,484 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 11:25:44,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 11:25:44,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 11:25:44,486 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 11:25:44,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 11:25:44,486 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 11:25:44,486 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 11:25:44,486 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 11:25:44,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 11:25:44,488 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 11:25:44,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 11:25:44,488 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 11:25:44,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 11:25:44,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 11:25:44,489 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 11:25:44,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 11:25:44,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 11:25:44,489 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 11:25:44,489 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 11:25:44,490 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 [2018-10-10 11:25:44,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 11:25:44,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 11:25:44,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 11:25:44,570 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 11:25:44,570 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 11:25:44,571 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-10-10 11:25:44,849 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5a36b81/3de87d7a40df4c5aae62eb2fa4a2dee6/FLAG5023151eb [2018-10-10 11:25:45,120 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 11:25:45,121 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-10-10 11:25:45,135 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5a36b81/3de87d7a40df4c5aae62eb2fa4a2dee6/FLAG5023151eb [2018-10-10 11:25:45,150 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f5a36b81/3de87d7a40df4c5aae62eb2fa4a2dee6 [2018-10-10 11:25:45,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 11:25:45,163 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 11:25:45,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:45,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 11:25:45,168 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 11:25:45,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6ee0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45, skipping insertion in model container [2018-10-10 11:25:45,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 11:25:45,231 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 11:25:45,508 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:45,519 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 11:25:45,591 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:45,644 INFO L193 MainTranslator]: Completed translation [2018-10-10 11:25:45,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45 WrapperNode [2018-10-10 11:25:45,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:45,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:45,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 11:25:45,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 11:25:45,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:45,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 11:25:45,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 11:25:45,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 11:25:45,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... [2018-10-10 11:25:45,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 11:25:45,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 11:25:45,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 11:25:45,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 11:25:45,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 11:25:45,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 11:25:45,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 11:25:47,049 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 11:25:47,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:47 BoogieIcfgContainer [2018-10-10 11:25:47,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 11:25:47,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 11:25:47,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 11:25:47,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 11:25:47,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:25:45" (1/3) ... [2018-10-10 11:25:47,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de8c440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:47, skipping insertion in model container [2018-10-10 11:25:47,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:45" (2/3) ... [2018-10-10 11:25:47,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de8c440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:47, skipping insertion in model container [2018-10-10 11:25:47,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:47" (3/3) ... [2018-10-10 11:25:47,059 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_true-unreach-call_true-valid-memsafety.i [2018-10-10 11:25:47,069 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 11:25:47,078 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-10-10 11:25:47,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2018-10-10 11:25:47,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 11:25:47,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 11:25:47,127 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 11:25:47,127 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 11:25:47,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 11:25:47,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 11:25:47,127 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 11:25:47,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 11:25:47,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 11:25:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-10-10 11:25:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-10 11:25:47,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:47,159 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-10 11:25:47,162 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:47,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2018-10-10 11:25:47,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:47,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:47,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:47,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:47,323 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 11:25:47,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:47,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:25:47,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:47,350 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2018-10-10 11:25:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:48,032 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-10-10 11:25:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:48,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-10 11:25:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:48,047 INFO L225 Difference]: With dead ends: 150 [2018-10-10 11:25:48,047 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 11:25:48,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 11:25:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2018-10-10 11:25:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 11:25:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-10-10 11:25:48,093 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 3 [2018-10-10 11:25:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:48,094 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-10-10 11:25:48,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-10-10 11:25:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-10 11:25:48,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:48,095 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-10 11:25:48,096 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:48,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2018-10-10 11:25:48,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:48,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:48,241 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 11:25:48,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:48,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:25:48,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:48,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:48,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:48,245 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 3 states. [2018-10-10 11:25:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:48,884 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-10-10 11:25:48,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:48,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-10 11:25:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:48,890 INFO L225 Difference]: With dead ends: 193 [2018-10-10 11:25:48,890 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 11:25:48,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:48,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 11:25:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 119. [2018-10-10 11:25:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 11:25:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-10-10 11:25:48,904 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 4 [2018-10-10 11:25:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:48,904 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-10-10 11:25:48,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-10-10 11:25:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-10 11:25:48,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:48,905 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-10 11:25:48,907 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:48,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2018-10-10 11:25:48,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:48,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:48,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:48,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:49,038 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 11:25:49,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:49,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:49,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:49,040 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 5 states. [2018-10-10 11:25:49,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:49,431 INFO L93 Difference]: Finished difference Result 212 states and 222 transitions. [2018-10-10 11:25:49,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:49,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-10 11:25:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:49,436 INFO L225 Difference]: With dead ends: 212 [2018-10-10 11:25:49,436 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 11:25:49,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 11:25:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 161. [2018-10-10 11:25:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 11:25:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 189 transitions. [2018-10-10 11:25:49,461 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 189 transitions. Word has length 5 [2018-10-10 11:25:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:49,462 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 189 transitions. [2018-10-10 11:25:49,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 189 transitions. [2018-10-10 11:25:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-10 11:25:49,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:49,464 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-10 11:25:49,466 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:49,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash 889475910, now seen corresponding path program 1 times [2018-10-10 11:25:49,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:49,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:49,632 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 11:25:49,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:49,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:25:49,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:25:49,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:25:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:25:49,635 INFO L87 Difference]: Start difference. First operand 161 states and 189 transitions. Second operand 4 states. [2018-10-10 11:25:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:50,111 INFO L93 Difference]: Finished difference Result 245 states and 256 transitions. [2018-10-10 11:25:50,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:25:50,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-10 11:25:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:50,114 INFO L225 Difference]: With dead ends: 245 [2018-10-10 11:25:50,114 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 11:25:50,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 11:25:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 171. [2018-10-10 11:25:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 11:25:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2018-10-10 11:25:50,146 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 6 [2018-10-10 11:25:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:50,146 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2018-10-10 11:25:50,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:25:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-10-10 11:25:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-10 11:25:50,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:50,147 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:50,151 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:50,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:50,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1466829910, now seen corresponding path program 1 times [2018-10-10 11:25:50,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:50,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:50,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:50,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:50,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:50,336 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 11:25:50,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:50,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:50,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:50,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:50,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:50,338 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand 6 states. [2018-10-10 11:25:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:51,061 INFO L93 Difference]: Finished difference Result 276 states and 292 transitions. [2018-10-10 11:25:51,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:51,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-10 11:25:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:51,065 INFO L225 Difference]: With dead ends: 276 [2018-10-10 11:25:51,065 INFO L226 Difference]: Without dead ends: 276 [2018-10-10 11:25:51,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-10 11:25:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-10 11:25:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 134. [2018-10-10 11:25:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 11:25:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-10-10 11:25:51,078 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 10 [2018-10-10 11:25:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:51,079 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-10-10 11:25:51,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-10-10 11:25:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-10 11:25:51,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:51,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:51,084 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:51,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1772913101, now seen corresponding path program 1 times [2018-10-10 11:25:51,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:51,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:51,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:51,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:51,249 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 11:25:51,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:51,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:51,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:51,251 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 7 states. [2018-10-10 11:25:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:52,200 INFO L93 Difference]: Finished difference Result 313 states and 330 transitions. [2018-10-10 11:25:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:52,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-10 11:25:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:52,206 INFO L225 Difference]: With dead ends: 313 [2018-10-10 11:25:52,206 INFO L226 Difference]: Without dead ends: 313 [2018-10-10 11:25:52,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:25:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-10 11:25:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 135. [2018-10-10 11:25:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 11:25:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-10-10 11:25:52,213 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 11 [2018-10-10 11:25:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:52,213 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-10-10 11:25:52,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-10-10 11:25:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-10 11:25:52,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:52,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:52,216 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:52,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash -874268660, now seen corresponding path program 1 times [2018-10-10 11:25:52,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:52,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:52,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:52,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:52,282 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 11:25:52,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:52,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:52,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:52,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:52,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:52,284 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 5 states. [2018-10-10 11:25:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:52,635 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2018-10-10 11:25:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:52,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-10 11:25:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:52,638 INFO L225 Difference]: With dead ends: 160 [2018-10-10 11:25:52,638 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 11:25:52,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 11:25:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 131. [2018-10-10 11:25:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 11:25:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-10-10 11:25:52,644 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 12 [2018-10-10 11:25:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:52,644 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-10-10 11:25:52,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-10-10 11:25:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-10 11:25:52,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:52,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:52,647 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:52,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:52,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1332524625, now seen corresponding path program 1 times [2018-10-10 11:25:52,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:52,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:52,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:52,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:52,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:52,845 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 11:25:52,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:52,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:52,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:52,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:52,847 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 6 states. [2018-10-10 11:25:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:53,399 INFO L93 Difference]: Finished difference Result 219 states and 235 transitions. [2018-10-10 11:25:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:53,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-10 11:25:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:53,406 INFO L225 Difference]: With dead ends: 219 [2018-10-10 11:25:53,406 INFO L226 Difference]: Without dead ends: 219 [2018-10-10 11:25:53,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:25:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-10 11:25:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 133. [2018-10-10 11:25:53,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 11:25:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-10-10 11:25:53,411 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 13 [2018-10-10 11:25:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:53,411 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-10-10 11:25:53,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-10-10 11:25:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-10 11:25:53,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:53,412 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:53,413 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:53,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1641409646, now seen corresponding path program 1 times [2018-10-10 11:25:53,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:53,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:53,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:53,503 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 11:25:53,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:53,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:53,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:53,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:53,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:53,504 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 5 states. [2018-10-10 11:25:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:53,908 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-10-10 11:25:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:53,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-10 11:25:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:53,911 INFO L225 Difference]: With dead ends: 140 [2018-10-10 11:25:53,911 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 11:25:53,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 11:25:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 131. [2018-10-10 11:25:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 11:25:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-10-10 11:25:53,916 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 14 [2018-10-10 11:25:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:53,916 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-10-10 11:25:53,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-10-10 11:25:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-10 11:25:53,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:53,917 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:53,918 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:53,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1127240621, now seen corresponding path program 1 times [2018-10-10 11:25:53,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:53,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:53,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:54,028 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 11:25:54,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:54,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:54,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:54,031 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 7 states. [2018-10-10 11:25:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:54,614 INFO L93 Difference]: Finished difference Result 263 states and 279 transitions. [2018-10-10 11:25:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 11:25:54,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-10-10 11:25:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:54,618 INFO L225 Difference]: With dead ends: 263 [2018-10-10 11:25:54,618 INFO L226 Difference]: Without dead ends: 263 [2018-10-10 11:25:54,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-10 11:25:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-10 11:25:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 133. [2018-10-10 11:25:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 11:25:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2018-10-10 11:25:54,623 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 15 [2018-10-10 11:25:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:54,624 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2018-10-10 11:25:54,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2018-10-10 11:25:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-10 11:25:54,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:54,625 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:54,626 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:54,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash -655908463, now seen corresponding path program 1 times [2018-10-10 11:25:54,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:54,714 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 11:25:54,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:54,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:54,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:54,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:54,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:54,716 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand 5 states. [2018-10-10 11:25:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:55,019 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-10-10 11:25:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:55,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-10 11:25:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:55,021 INFO L225 Difference]: With dead ends: 131 [2018-10-10 11:25:55,021 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 11:25:55,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 11:25:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-10 11:25:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 11:25:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-10-10 11:25:55,027 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 15 [2018-10-10 11:25:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:55,028 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-10-10 11:25:55,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-10-10 11:25:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-10 11:25:55,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:55,029 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:55,030 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:55,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:55,031 INFO L82 PathProgramCache]: Analyzing trace with hash -584720761, now seen corresponding path program 1 times [2018-10-10 11:25:55,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:55,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:55,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:55,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:55,159 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 11:25:55,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:55,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:55,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:55,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:55,161 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 5 states. [2018-10-10 11:25:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:55,630 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2018-10-10 11:25:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:55,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-10 11:25:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:55,632 INFO L225 Difference]: With dead ends: 189 [2018-10-10 11:25:55,632 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 11:25:55,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 11:25:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 131. [2018-10-10 11:25:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 11:25:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2018-10-10 11:25:55,638 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 16 [2018-10-10 11:25:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:55,638 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2018-10-10 11:25:55,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2018-10-10 11:25:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-10 11:25:55,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:55,639 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:55,640 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:55,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1032161683, now seen corresponding path program 1 times [2018-10-10 11:25:55,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:55,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:55,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:55,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:55,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:55,830 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 11:25:56,030 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 11:25:56,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:56,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:56,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:56,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:56,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:56,031 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 6 states. [2018-10-10 11:25:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:56,398 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-10-10 11:25:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:25:56,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-10 11:25:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:56,401 INFO L225 Difference]: With dead ends: 136 [2018-10-10 11:25:56,401 INFO L226 Difference]: Without dead ends: 136 [2018-10-10 11:25:56,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:25:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-10 11:25:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-10-10 11:25:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 11:25:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2018-10-10 11:25:56,405 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 17 [2018-10-10 11:25:56,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:56,405 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2018-10-10 11:25:56,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2018-10-10 11:25:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-10 11:25:56,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:56,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:56,407 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:56,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1932241171, now seen corresponding path program 1 times [2018-10-10 11:25:56,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:56,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:56,595 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 11:25:56,817 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 11:25:56,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:56,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:56,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:56,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:56,819 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand 7 states. [2018-10-10 11:25:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:57,529 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2018-10-10 11:25:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 11:25:57,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-10 11:25:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:57,531 INFO L225 Difference]: With dead ends: 211 [2018-10-10 11:25:57,531 INFO L226 Difference]: Without dead ends: 211 [2018-10-10 11:25:57,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-10-10 11:25:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-10 11:25:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 125. [2018-10-10 11:25:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 11:25:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-10-10 11:25:57,535 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 18 [2018-10-10 11:25:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:57,536 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-10-10 11:25:57,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-10-10 11:25:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-10 11:25:57,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:57,537 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] [2018-10-10 11:25:57,537 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:57,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1463621595, now seen corresponding path program 1 times [2018-10-10 11:25:57,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:57,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:57,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:57,711 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-10 11:25:57,808 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 11:25:57,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:57,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:57,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:57,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:57,810 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 7 states. [2018-10-10 11:25:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:58,694 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-10-10 11:25:58,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:58,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-10 11:25:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:58,695 INFO L225 Difference]: With dead ends: 124 [2018-10-10 11:25:58,695 INFO L226 Difference]: Without dead ends: 124 [2018-10-10 11:25:58,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:25:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-10 11:25:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-10 11:25:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 11:25:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2018-10-10 11:25:58,698 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 20 [2018-10-10 11:25:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:58,699 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2018-10-10 11:25:58,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2018-10-10 11:25:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-10 11:25:58,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:58,700 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] [2018-10-10 11:25:58,700 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:58,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2086049629, now seen corresponding path program 1 times [2018-10-10 11:25:58,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:58,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:58,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:58,798 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 11:25:58,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:58,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:58,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:58,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:58,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:58,801 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 7 states. [2018-10-10 11:25:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:59,202 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-10-10 11:25:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 11:25:59,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-10 11:25:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:59,204 INFO L225 Difference]: With dead ends: 173 [2018-10-10 11:25:59,204 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 11:25:59,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 11:25:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 11:25:59,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 114. [2018-10-10 11:25:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 11:25:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-10-10 11:25:59,208 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 22 [2018-10-10 11:25:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:59,208 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-10-10 11:25:59,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:59,208 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-10-10 11:25:59,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 11:25:59,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:59,210 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] [2018-10-10 11:25:59,210 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:59,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash 7797910, now seen corresponding path program 1 times [2018-10-10 11:25:59,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:59,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:59,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:59,424 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 11:25:59,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:59,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:25:59,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:25:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:25:59,426 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 4 states. [2018-10-10 11:25:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:59,912 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-10-10 11:25:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:25:59,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-10-10 11:25:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:59,914 INFO L225 Difference]: With dead ends: 140 [2018-10-10 11:25:59,914 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 11:25:59,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 11:25:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 114. [2018-10-10 11:25:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 11:25:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-10-10 11:25:59,917 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 24 [2018-10-10 11:25:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:59,917 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-10-10 11:25:59,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:25:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-10-10 11:25:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 11:25:59,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:59,919 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] [2018-10-10 11:25:59,919 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:59,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:59,919 INFO L82 PathProgramCache]: Analyzing trace with hash 7733173, now seen corresponding path program 1 times [2018-10-10 11:25:59,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:59,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:59,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:00,040 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 11:26:00,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:00,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:26:00,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:26:00,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:26:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:26:00,042 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 6 states. [2018-10-10 11:26:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:00,314 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2018-10-10 11:26:00,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:26:00,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-10 11:26:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:00,315 INFO L225 Difference]: With dead ends: 132 [2018-10-10 11:26:00,315 INFO L226 Difference]: Without dead ends: 132 [2018-10-10 11:26:00,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:26:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-10 11:26:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2018-10-10 11:26:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 11:26:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-10-10 11:26:00,319 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 24 [2018-10-10 11:26:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:00,320 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-10-10 11:26:00,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:26:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-10-10 11:26:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-10 11:26:00,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:00,321 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] [2018-10-10 11:26:00,321 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:26:00,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:00,322 INFO L82 PathProgramCache]: Analyzing trace with hash 239728519, now seen corresponding path program 1 times [2018-10-10 11:26:00,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:00,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:00,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:00,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:00,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:00,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:00,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:26:00,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:26:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:26:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:26:00,534 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2018-10-10 11:26:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:01,740 INFO L93 Difference]: Finished difference Result 190 states and 205 transitions. [2018-10-10 11:26:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:26:01,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-10 11:26:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:01,742 INFO L225 Difference]: With dead ends: 190 [2018-10-10 11:26:01,742 INFO L226 Difference]: Without dead ends: 190 [2018-10-10 11:26:01,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:26:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-10 11:26:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 118. [2018-10-10 11:26:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 11:26:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-10-10 11:26:01,745 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 25 [2018-10-10 11:26:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:01,745 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-10-10 11:26:01,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:26:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-10-10 11:26:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-10 11:26:01,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:01,746 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:01,747 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:26:01,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash -33562794, now seen corresponding path program 1 times [2018-10-10 11:26:01,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:01,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:01,903 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 11:26:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:02,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 11:26:02,075 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 11:26:02,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:02,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:26:02,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 11:26:02,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:26:02,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 11:26:02,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:26:02,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-10 11:26:02,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:26:02,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:26:02,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 11:26:02,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 11:26:02,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:02,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-10-10 11:26:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:02,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 11:26:02,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-10 11:26:02,731 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= v_ULTIMATE.start_main_~list~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_#length_2|), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base_1| |v_#memory_$Pointer$.base_1|), (= |v_ULTIMATE.start_write~$Pointer$_#value.base_1| 0), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~list~0.offset_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= v_ULTIMATE.start_main_~list~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType_1| 4), (= |v_ULTIMATE.start_write~$Pointer$_#value.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_int_1| |v_#memory_int_1|), (= |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~list~0.base_1), (= |v_ULTIMATE.start_main_#t~malloc0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_#valid_4|)] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:174) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.extractUpdateRhs(SimultaneousUpdate.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:171) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.extractUpdateRhs(SimultaneousUpdate.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:104) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java:489) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructNewImplementation(PathProgramDumper.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.(PathProgramDumper.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.doDump(PathProgramDumpController.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.reportPathProgram(PathProgramDumpController.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-10 11:26:02,734 INFO L168 Benchmark]: Toolchain (without parser) took 17572.50 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -475.8 MB). Peak memory consumption was 397.1 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:02,735 INFO L168 Benchmark]: CDTParser took 0.25 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 11:26:02,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.49 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 11:26:02,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.24 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:02,738 INFO L168 Benchmark]: Boogie Preprocessor took 138.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:02,739 INFO L168 Benchmark]: RCFGBuilder took 1196.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:02,739 INFO L168 Benchmark]: TraceAbstraction took 15682.03 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 269.1 MB). Peak memory consumption was 403.3 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:02,746 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 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 481.49 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 69.24 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.7 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1196.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15682.03 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 269.1 MB). Peak memory consumption was 403.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= v_ULTIMATE.start_main_~list~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_#length_2|), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base_1| |v_#memory_$Pointer$.base_1|), (= |v_ULTIMATE.start_write~$Pointer$_#value.base_1| 0), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~list~0.offset_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= v_ULTIMATE.start_main_~list~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType_1| 4), (= |v_ULTIMATE.start_write~$Pointer$_#value.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_int_1| |v_#memory_int_1|), (= |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~list~0.base_1), (= |v_ULTIMATE.start_main_#t~malloc0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_#valid_4|)] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form, |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| has two outvars in equality [(not (= 0 |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_#length_1| (store |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| |v_ULTIMATE.start_#Ultimate.alloc_~size_1|)), (= v_ULTIMATE.start_main_~list~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#length_1| |v_#length_2|), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.base_1| |v_#memory_$Pointer$.base_1|), (= |v_ULTIMATE.start_write~$Pointer$_#value.base_1| 0), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~list~0.offset_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= v_ULTIMATE.start_main_~list~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= 0 (select |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|)), (= |v_ULTIMATE.start_write~$Pointer$_#sizeOfWrittenType_1| 4), (= |v_ULTIMATE.start_write~$Pointer$_#value.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_int_1| |v_#memory_int_1|), (= |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1|), (= (store |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.base_1| 1) |v_#valid_3|), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~list~0.base_1), (= |v_ULTIMATE.start_main_#t~malloc0.offset_1| |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_old_#valid_1| |v_#valid_4|)]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.computeSubstitutionMapping(SimultaneousUpdate.java:174) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...