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-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 11:25:34,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 11:25:34,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 11:25:34,031 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 11:25:34,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 11:25:34,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 11:25:34,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 11:25:34,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 11:25:34,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 11:25:34,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 11:25:34,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 11:25:34,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 11:25:34,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 11:25:34,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 11:25:34,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 11:25:34,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 11:25:34,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 11:25:34,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 11:25:34,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 11:25:34,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 11:25:34,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 11:25:34,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 11:25:34,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 11:25:34,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 11:25:34,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 11:25:34,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 11:25:34,068 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 11:25:34,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 11:25:34,074 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 11:25:34,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 11:25:34,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 11:25:34,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 11:25:34,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 11:25:34,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 11:25:34,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 11:25:34,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 11:25:34,083 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:34,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 11:25:34,113 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 11:25:34,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 11:25:34,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 11:25:34,118 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 11:25:34,118 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 11:25:34,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 11:25:34,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 11:25:34,119 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 11:25:34,119 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 11:25:34,119 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 11:25:34,120 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 11:25:34,120 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 11:25:34,120 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 11:25:34,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 11:25:34,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 11:25:34,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 11:25:34,121 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 11:25:34,121 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 11:25:34,121 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 11:25:34,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 11:25:34,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 11:25:34,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 11:25:34,122 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 11:25:34,122 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 11:25:34,123 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:34,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 11:25:34,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 11:25:34,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 11:25:34,200 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 11:25:34,200 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 11:25:34,201 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-10-10 11:25:34,522 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1092ebe1/c79863c53fd7423a9d381bed4476ece4/FLAG1cb847e2d [2018-10-10 11:25:34,776 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 11:25:34,777 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-10-10 11:25:34,792 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1092ebe1/c79863c53fd7423a9d381bed4476ece4/FLAG1cb847e2d [2018-10-10 11:25:34,808 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1092ebe1/c79863c53fd7423a9d381bed4476ece4 [2018-10-10 11:25:34,818 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 11:25:34,820 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 11:25:34,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:34,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 11:25:34,825 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 11:25:34,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:34" (1/1) ... [2018-10-10 11:25:34,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c3c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:34, skipping insertion in model container [2018-10-10 11:25:34,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:25:34" (1/1) ... [2018-10-10 11:25:34,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 11:25:34,889 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 11:25:35,143 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:35,163 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 11:25:35,252 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 11:25:35,324 INFO L193 MainTranslator]: Completed translation [2018-10-10 11:25:35,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:35 WrapperNode [2018-10-10 11:25:35,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 11:25:35,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:35,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 11:25:35,326 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 11:25:35,336 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:35" (1/1) ... [2018-10-10 11:25:35,360 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:35" (1/1) ... [2018-10-10 11:25:35,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 11:25:35,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 11:25:35,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 11:25:35,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 11:25:35,423 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:35" (1/1) ... [2018-10-10 11:25:35,424 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:35" (1/1) ... [2018-10-10 11:25:35,432 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:35" (1/1) ... [2018-10-10 11:25:35,432 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:35" (1/1) ... [2018-10-10 11:25:35,446 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:35" (1/1) ... [2018-10-10 11:25:35,539 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:35" (1/1) ... [2018-10-10 11:25:35,543 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:35" (1/1) ... [2018-10-10 11:25:35,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 11:25:35,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 11:25:35,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 11:25:35,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 11:25:35,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:35" (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:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 11:25:35,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 11:25:36,697 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 11:25:36,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:36 BoogieIcfgContainer [2018-10-10 11:25:36,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 11:25:36,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 11:25:36,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 11:25:36,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 11:25:36,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:25:34" (1/3) ... [2018-10-10 11:25:36,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213e3fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:36, skipping insertion in model container [2018-10-10 11:25:36,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:25:35" (2/3) ... [2018-10-10 11:25:36,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@213e3fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:25:36, skipping insertion in model container [2018-10-10 11:25:36,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:25:36" (3/3) ... [2018-10-10 11:25:36,706 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-10-10 11:25:36,716 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 11:25:36,727 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-10-10 11:25:36,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2018-10-10 11:25:36,778 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 11:25:36,779 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 11:25:36,779 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 11:25:36,780 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 11:25:36,780 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 11:25:36,781 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 11:25:36,781 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 11:25:36,781 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 11:25:36,781 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 11:25:36,798 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states. [2018-10-10 11:25:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-10 11:25:36,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:36,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-10 11:25:36,811 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:36,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2018-10-10 11:25:36,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:36,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:36,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:36,978 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:36,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:36,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:25:36,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:36,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:37,002 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 3 states. [2018-10-10 11:25:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:37,489 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-10-10 11:25:37,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:37,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-10 11:25:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:37,504 INFO L225 Difference]: With dead ends: 129 [2018-10-10 11:25:37,505 INFO L226 Difference]: Without dead ends: 123 [2018-10-10 11:25:37,506 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:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-10 11:25:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2018-10-10 11:25:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 11:25:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-10-10 11:25:37,550 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 3 [2018-10-10 11:25:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:37,550 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-10-10 11:25:37,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-10-10 11:25:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-10 11:25:37,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:37,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-10 11:25:37,553 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:37,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2018-10-10 11:25:37,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:37,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:37,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:37,644 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:37,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:37,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 11:25:37,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 11:25:37,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 11:25:37,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 11:25:37,647 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 3 states. [2018-10-10 11:25:38,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:38,187 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-10-10 11:25:38,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 11:25:38,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-10 11:25:38,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:38,191 INFO L225 Difference]: With dead ends: 131 [2018-10-10 11:25:38,191 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 11:25:38,192 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:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 11:25:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 109. [2018-10-10 11:25:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-10 11:25:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-10-10 11:25:38,214 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 4 [2018-10-10 11:25:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:38,215 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-10-10 11:25:38,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 11:25:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-10-10 11:25:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-10 11:25:38,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:38,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-10 11:25:38,218 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:38,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash 28692770, now seen corresponding path program 1 times [2018-10-10 11:25:38,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:38,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:38,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:38,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:38,330 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:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:38,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:38,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:38,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:38,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:38,333 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 5 states. [2018-10-10 11:25:38,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:38,707 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-10-10 11:25:38,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:25:38,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-10 11:25:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:38,710 INFO L225 Difference]: With dead ends: 145 [2018-10-10 11:25:38,710 INFO L226 Difference]: Without dead ends: 145 [2018-10-10 11:25:38,711 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:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-10 11:25:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 107. [2018-10-10 11:25:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-10 11:25:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-10-10 11:25:38,720 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 5 [2018-10-10 11:25:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:38,721 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-10-10 11:25:38,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-10-10 11:25:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-10 11:25:38,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:38,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-10 11:25:38,723 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:38,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash 889475910, now seen corresponding path program 1 times [2018-10-10 11:25:38,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:38,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:38,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:38,806 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:38,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:38,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 11:25:38,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:25:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:25:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:25:38,808 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 4 states. [2018-10-10 11:25:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:39,147 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-10-10 11:25:39,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 11:25:39,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-10 11:25:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:39,150 INFO L225 Difference]: With dead ends: 172 [2018-10-10 11:25:39,150 INFO L226 Difference]: Without dead ends: 172 [2018-10-10 11:25:39,151 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:39,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-10 11:25:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 105. [2018-10-10 11:25:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-10 11:25:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-10-10 11:25:39,159 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 6 [2018-10-10 11:25:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:39,160 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-10-10 11:25:39,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:25:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-10-10 11:25:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-10 11:25:39,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:39,161 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:39,162 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:39,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1466829910, now seen corresponding path program 1 times [2018-10-10 11:25:39,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:39,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:39,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:39,343 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:39,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:39,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:39,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:39,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:39,346 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 6 states. [2018-10-10 11:25:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:40,369 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2018-10-10 11:25:40,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:40,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-10 11:25:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:40,377 INFO L225 Difference]: With dead ends: 208 [2018-10-10 11:25:40,377 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 11:25:40,377 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:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 11:25:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 128. [2018-10-10 11:25:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 11:25:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 148 transitions. [2018-10-10 11:25:40,389 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 148 transitions. Word has length 10 [2018-10-10 11:25:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:40,389 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 148 transitions. [2018-10-10 11:25:40,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 148 transitions. [2018-10-10 11:25:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-10 11:25:40,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:40,390 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:40,392 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:40,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1772913101, now seen corresponding path program 1 times [2018-10-10 11:25:40,392 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:40,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:40,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:40,605 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:40,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:40,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:40,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:40,607 INFO L87 Difference]: Start difference. First operand 128 states and 148 transitions. Second operand 7 states. [2018-10-10 11:25:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:41,446 INFO L93 Difference]: Finished difference Result 276 states and 294 transitions. [2018-10-10 11:25:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:41,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-10 11:25:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:41,449 INFO L225 Difference]: With dead ends: 276 [2018-10-10 11:25:41,450 INFO L226 Difference]: Without dead ends: 276 [2018-10-10 11:25:41,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:25:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-10 11:25:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 129. [2018-10-10 11:25:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-10 11:25:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-10-10 11:25:41,458 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 11 [2018-10-10 11:25:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:41,459 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-10-10 11:25:41,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-10-10 11:25:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-10 11:25:41,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:41,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:41,461 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:41,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:41,462 INFO L82 PathProgramCache]: Analyzing trace with hash -874268660, now seen corresponding path program 1 times [2018-10-10 11:25:41,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:41,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:41,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:41,702 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:41,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:41,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:41,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:41,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:41,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:41,704 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-10-10 11:25:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:42,075 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2018-10-10 11:25:42,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:42,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-10 11:25:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:42,077 INFO L225 Difference]: With dead ends: 146 [2018-10-10 11:25:42,078 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 11:25:42,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 11:25:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 11:25:42,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2018-10-10 11:25:42,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 11:25:42,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2018-10-10 11:25:42,085 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 12 [2018-10-10 11:25:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:42,085 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2018-10-10 11:25:42,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2018-10-10 11:25:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-10 11:25:42,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:42,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:42,088 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:42,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:42,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1332524625, now seen corresponding path program 1 times [2018-10-10 11:25:42,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:42,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:42,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:42,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:42,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:42,200 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:42,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:42,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:42,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:42,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:42,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:42,202 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand 6 states. [2018-10-10 11:25:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:43,019 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-10-10 11:25:43,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:25:43,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-10 11:25:43,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:43,021 INFO L225 Difference]: With dead ends: 174 [2018-10-10 11:25:43,022 INFO L226 Difference]: Without dead ends: 174 [2018-10-10 11:25:43,023 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:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-10 11:25:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2018-10-10 11:25:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 11:25:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2018-10-10 11:25:43,028 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 13 [2018-10-10 11:25:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:43,029 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2018-10-10 11:25:43,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2018-10-10 11:25:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-10 11:25:43,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:43,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:43,031 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:43,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:43,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1601669444, now seen corresponding path program 1 times [2018-10-10 11:25:43,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:43,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:43,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:43,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:43,191 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:43,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:43,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:43,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:43,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:43,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:43,193 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand 7 states. [2018-10-10 11:25:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:43,751 INFO L93 Difference]: Finished difference Result 200 states and 216 transitions. [2018-10-10 11:25:43,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 11:25:43,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-10-10 11:25:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:43,755 INFO L225 Difference]: With dead ends: 200 [2018-10-10 11:25:43,756 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 11:25:43,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-10 11:25:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 11:25:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2018-10-10 11:25:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 11:25:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2018-10-10 11:25:43,761 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 14 [2018-10-10 11:25:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:43,762 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2018-10-10 11:25:43,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2018-10-10 11:25:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-10 11:25:43,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:43,763 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:43,764 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:43,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1641409646, now seen corresponding path program 1 times [2018-10-10 11:25:43,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:43,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:43,886 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:43,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:43,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:43,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:43,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:43,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:43,889 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 5 states. [2018-10-10 11:25:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:44,367 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2018-10-10 11:25:44,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:44,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-10 11:25:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:44,370 INFO L225 Difference]: With dead ends: 139 [2018-10-10 11:25:44,370 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 11:25:44,371 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:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 11:25:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-10-10 11:25:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 11:25:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2018-10-10 11:25:44,374 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 14 [2018-10-10 11:25:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:44,375 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2018-10-10 11:25:44,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2018-10-10 11:25:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-10 11:25:44,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:44,376 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:44,377 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:44,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1887854694, now seen corresponding path program 1 times [2018-10-10 11:25:44,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:44,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:44,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:44,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:44,492 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:44,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:44,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:44,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:44,494 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand 5 states. [2018-10-10 11:25:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:44,910 INFO L93 Difference]: Finished difference Result 199 states and 215 transitions. [2018-10-10 11:25:44,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:44,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-10 11:25:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:44,914 INFO L225 Difference]: With dead ends: 199 [2018-10-10 11:25:44,915 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 11:25:44,915 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:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 11:25:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 138. [2018-10-10 11:25:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 11:25:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2018-10-10 11:25:44,919 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 15 [2018-10-10 11:25:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:44,920 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2018-10-10 11:25:44,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2018-10-10 11:25:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-10 11:25:44,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:44,921 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:44,922 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:44,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:44,923 INFO L82 PathProgramCache]: Analyzing trace with hash -655908463, now seen corresponding path program 1 times [2018-10-10 11:25:44,923 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:44,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:44,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:44,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:45,104 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 11:25:45,214 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:45,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:45,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:45,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:45,216 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand 5 states. [2018-10-10 11:25:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:45,952 INFO L93 Difference]: Finished difference Result 226 states and 251 transitions. [2018-10-10 11:25:45,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 11:25:45,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-10 11:25:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:45,955 INFO L225 Difference]: With dead ends: 226 [2018-10-10 11:25:45,955 INFO L226 Difference]: Without dead ends: 226 [2018-10-10 11:25:45,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-10 11:25:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 137. [2018-10-10 11:25:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 11:25:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-10-10 11:25:45,961 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 15 [2018-10-10 11:25:45,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:45,961 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-10-10 11:25:45,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-10-10 11:25:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-10 11:25:45,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:45,963 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:45,964 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:45,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1141674192, now seen corresponding path program 1 times [2018-10-10 11:25:45,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:45,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:45,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:45,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:46,121 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:46,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:46,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:46,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:46,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:46,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:46,123 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 6 states. [2018-10-10 11:25:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:46,491 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-10-10 11:25:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:25:46,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-10 11:25:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:46,493 INFO L225 Difference]: With dead ends: 141 [2018-10-10 11:25:46,493 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 11:25:46,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 11:25:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 11:25:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2018-10-10 11:25:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 11:25:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2018-10-10 11:25:46,498 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 16 [2018-10-10 11:25:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:46,498 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2018-10-10 11:25:46,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2018-10-10 11:25:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-10 11:25:46,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:46,499 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:46,500 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:46,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1032161651, now seen corresponding path program 1 times [2018-10-10 11:25:46,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:46,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:46,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:46,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:46,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:46,677 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 11:25:46,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:46,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:46,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:25:46,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:25:46,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:25:46,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:25:46,847 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand 6 states. [2018-10-10 11:25:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:47,246 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-10-10 11:25:47,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:25:47,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-10-10 11:25:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:47,249 INFO L225 Difference]: With dead ends: 196 [2018-10-10 11:25:47,249 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 11:25:47,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-10 11:25:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 11:25:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2018-10-10 11:25:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 11:25:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2018-10-10 11:25:47,254 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 17 [2018-10-10 11:25:47,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:47,255 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2018-10-10 11:25:47,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:25:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2018-10-10 11:25:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-10 11:25:47,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:47,256 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:47,257 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:47,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:47,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1155470890, now seen corresponding path program 1 times [2018-10-10 11:25:47,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:47,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:47,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:47,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:47,770 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,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:47,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 11:25:47,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:47,772 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand 7 states. [2018-10-10 11:25:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:48,906 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2018-10-10 11:25:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 11:25:48,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-10-10 11:25:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:48,908 INFO L225 Difference]: With dead ends: 141 [2018-10-10 11:25:48,908 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 11:25:48,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:25:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 11:25:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-10-10 11:25:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 11:25:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2018-10-10 11:25:48,912 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 19 [2018-10-10 11:25:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:48,913 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2018-10-10 11:25:48,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2018-10-10 11:25:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-10 11:25:48,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:48,914 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:48,915 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:48,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1459859082, now seen corresponding path program 1 times [2018-10-10 11:25:48,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:48,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:49,109 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,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:49,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:25:49,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 11:25:49,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 11:25:49,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 11:25:49,113 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand 5 states. [2018-10-10 11:25:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:49,426 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2018-10-10 11:25:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 11:25:49,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-10 11:25:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:49,435 INFO L225 Difference]: With dead ends: 179 [2018-10-10 11:25:49,435 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 11:25:49,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:25:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 11:25:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 135. [2018-10-10 11:25:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 11:25:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-10-10 11:25:49,440 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 20 [2018-10-10 11:25:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:49,441 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-10-10 11:25:49,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 11:25:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-10-10 11:25:49,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-10 11:25:49,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:49,443 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] [2018-10-10 11:25:49,444 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:49,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1262719737, now seen corresponding path program 1 times [2018-10-10 11:25:49,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:49,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:49,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:49,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 11:25:49,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 11:25:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 11:25:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 11:25:49,567 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 7 states. [2018-10-10 11:25:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:49,941 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2018-10-10 11:25:49,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 11:25:49,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-10-10 11:25:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:49,946 INFO L225 Difference]: With dead ends: 151 [2018-10-10 11:25:49,946 INFO L226 Difference]: Without dead ends: 151 [2018-10-10 11:25:49,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-10-10 11:25:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-10 11:25:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2018-10-10 11:25:49,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-10 11:25:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2018-10-10 11:25:49,952 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 22 [2018-10-10 11:25:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:49,952 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2018-10-10 11:25:49,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 11:25:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2018-10-10 11:25:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-10 11:25:49,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:49,953 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:49,954 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:49,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash -62447680, now seen corresponding path program 1 times [2018-10-10 11:25:49,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:49,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:49,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:49,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:50,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 11:25:50,128 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:25:50,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:50,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:25:50,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:25:50,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:25:50,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:25:50,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:25:50,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-10 11:25:50,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:25:50,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:25:50,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-10-10 11:25:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:50,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 11:25:50,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-10 11:25:50,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 11:25:50,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 11:25:50,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:25:50,652 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 11 states. [2018-10-10 11:25:51,921 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-10-10 11:25:52,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:52,442 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2018-10-10 11:25:52,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 11:25:52,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-10-10 11:25:52,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:52,444 INFO L225 Difference]: With dead ends: 202 [2018-10-10 11:25:52,444 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 11:25:52,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2018-10-10 11:25:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 11:25:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 141. [2018-10-10 11:25:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 11:25:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 154 transitions. [2018-10-10 11:25:52,450 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 154 transitions. Word has length 22 [2018-10-10 11:25:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:52,450 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 154 transitions. [2018-10-10 11:25:52,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 11:25:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2018-10-10 11:25:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 11:25:52,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:52,451 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] [2018-10-10 11:25:52,452 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:52,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash 46392655, now seen corresponding path program 1 times [2018-10-10 11:25:52,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:52,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:52,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:52,766 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 11:25:52,839 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,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:52,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 11:25:52,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 11:25:52,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 11:25:52,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 11:25:52,841 INFO L87 Difference]: Start difference. First operand 141 states and 154 transitions. Second operand 8 states. [2018-10-10 11:25:53,951 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 11:25:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:54,348 INFO L93 Difference]: Finished difference Result 273 states and 290 transitions. [2018-10-10 11:25:54,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 11:25:54,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-10-10 11:25:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:54,351 INFO L225 Difference]: With dead ends: 273 [2018-10-10 11:25:54,351 INFO L226 Difference]: Without dead ends: 273 [2018-10-10 11:25:54,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-10-10 11:25:54,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-10 11:25:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 141. [2018-10-10 11:25:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 11:25:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2018-10-10 11:25:54,356 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 23 [2018-10-10 11:25:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:54,356 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2018-10-10 11:25:54,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 11:25:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2018-10-10 11:25:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 11:25:54,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:54,357 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:54,358 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:54,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash 117323490, now seen corresponding path program 1 times [2018-10-10 11:25:54,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:54,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:54,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 11:25:54,976 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 11:25:54,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:55,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:25:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:55,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 11:25:55,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-10-10 11:25:55,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 11:25:55,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 11:25:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:25:55,220 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand 11 states. [2018-10-10 11:25:56,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:56,272 INFO L93 Difference]: Finished difference Result 160 states and 175 transitions. [2018-10-10 11:25:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 11:25:56,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-10-10 11:25:56,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:56,275 INFO L225 Difference]: With dead ends: 160 [2018-10-10 11:25:56,275 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 11:25:56,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2018-10-10 11:25:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 11:25:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2018-10-10 11:25:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 11:25:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-10-10 11:25:56,280 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 24 [2018-10-10 11:25:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:56,280 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-10-10 11:25:56,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 11:25:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-10-10 11:25:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-10 11:25:56,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:56,282 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] [2018-10-10 11:25:56,282 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:56,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:56,283 INFO L82 PathProgramCache]: Analyzing trace with hash 916903275, now seen corresponding path program 1 times [2018-10-10 11:25:56,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:56,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:25:56,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:56,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 11:25:56,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 11:25:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 11:25:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 11:25:56,427 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 9 states. [2018-10-10 11:25:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:57,252 INFO L93 Difference]: Finished difference Result 263 states and 279 transitions. [2018-10-10 11:25:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 11:25:57,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-10-10 11:25:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:57,254 INFO L225 Difference]: With dead ends: 263 [2018-10-10 11:25:57,254 INFO L226 Difference]: Without dead ends: 263 [2018-10-10 11:25:57,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2018-10-10 11:25:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-10 11:25:57,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 142. [2018-10-10 11:25:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-10 11:25:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2018-10-10 11:25:57,258 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 26 [2018-10-10 11:25:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:57,259 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2018-10-10 11:25:57,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 11:25:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2018-10-10 11:25:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-10 11:25:57,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:57,260 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:57,260 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:57,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1057216705, now seen corresponding path program 1 times [2018-10-10 11:25:57,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:57,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:57,538 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 11:25:57,802 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,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:57,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 11:25:57,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 11:25:57,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 11:25:57,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-10 11:25:57,804 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 11 states. [2018-10-10 11:25:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:25:58,800 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2018-10-10 11:25:58,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 11:25:58,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-10-10 11:25:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:25:58,804 INFO L225 Difference]: With dead ends: 192 [2018-10-10 11:25:58,804 INFO L226 Difference]: Without dead ends: 192 [2018-10-10 11:25:58,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=550, Unknown=0, NotChecked=0, Total=756 [2018-10-10 11:25:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-10 11:25:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2018-10-10 11:25:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 11:25:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2018-10-10 11:25:58,808 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 27 [2018-10-10 11:25:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:25:58,808 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2018-10-10 11:25:58,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 11:25:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2018-10-10 11:25:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-10 11:25:58,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:25:58,809 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:25:58,809 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:25:58,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:25:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1586020342, now seen corresponding path program 1 times [2018-10-10 11:25:58,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:25:58,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:25:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:58,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:25:58,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:25:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:25:59,207 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,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:25:59,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 11:25:59,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 11:25:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 11:25:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:25:59,208 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand 12 states. [2018-10-10 11:26:00,091 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-10-10 11:26:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:01,987 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-10-10 11:26:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 11:26:01,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-10 11:26:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:01,989 INFO L225 Difference]: With dead ends: 249 [2018-10-10 11:26:01,989 INFO L226 Difference]: Without dead ends: 249 [2018-10-10 11:26:01,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 11:26:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-10 11:26:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 149. [2018-10-10 11:26:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 11:26:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2018-10-10 11:26:01,993 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 28 [2018-10-10 11:26:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:01,994 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2018-10-10 11:26:01,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 11:26:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2018-10-10 11:26:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-10 11:26:01,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:01,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:01,995 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:26:01,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:01,995 INFO L82 PathProgramCache]: Analyzing trace with hash -220407059, now seen corresponding path program 1 times [2018-10-10 11:26:01,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:01,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:01,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:01,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:01,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:02,087 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:02,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 11:26:02,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 11:26:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 11:26:02,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 11:26:02,088 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand 4 states. [2018-10-10 11:26:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:02,209 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2018-10-10 11:26:02,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 11:26:02,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-10-10 11:26:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:02,210 INFO L225 Difference]: With dead ends: 159 [2018-10-10 11:26:02,211 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 11:26:02,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:26:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 11:26:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2018-10-10 11:26:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 11:26:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2018-10-10 11:26:02,214 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 31 [2018-10-10 11:26:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:02,215 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2018-10-10 11:26:02,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 11:26:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2018-10-10 11:26:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-10 11:26:02,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:02,216 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:02,216 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:26:02,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:02,216 INFO L82 PathProgramCache]: Analyzing trace with hash -196592518, now seen corresponding path program 1 times [2018-10-10 11:26:02,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:02,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:02,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:02,335 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:02,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:02,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 11:26:02,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 11:26:02,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 11:26:02,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 11:26:02,336 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 6 states. [2018-10-10 11:26:02,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:02,582 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2018-10-10 11:26:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 11:26:02,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-10-10 11:26:02,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:02,584 INFO L225 Difference]: With dead ends: 159 [2018-10-10 11:26:02,584 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 11:26:02,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 11:26:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 11:26:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2018-10-10 11:26:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-10 11:26:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-10-10 11:26:02,588 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 31 [2018-10-10 11:26:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:02,590 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-10-10 11:26:02,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 11:26:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-10-10 11:26:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-10 11:26:02,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:02,590 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:02,591 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:26:02,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1799400562, now seen corresponding path program 1 times [2018-10-10 11:26:02,591 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:02,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:02,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:02,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:02,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:02,982 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:02,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 11:26:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 11:26:02,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 11:26:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 11:26:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 11:26:02,983 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 12 states. [2018-10-10 11:26:03,974 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2018-10-10 11:26:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 11:26:04,947 INFO L93 Difference]: Finished difference Result 214 states and 230 transitions. [2018-10-10 11:26:04,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 11:26:04,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-10-10 11:26:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 11:26:04,949 INFO L225 Difference]: With dead ends: 214 [2018-10-10 11:26:04,949 INFO L226 Difference]: Without dead ends: 214 [2018-10-10 11:26:04,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=419, Invalid=1387, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 11:26:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-10 11:26:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2018-10-10 11:26:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-10 11:26:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 189 transitions. [2018-10-10 11:26:04,953 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 189 transitions. Word has length 32 [2018-10-10 11:26:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 11:26:04,953 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 189 transitions. [2018-10-10 11:26:04,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 11:26:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 189 transitions. [2018-10-10 11:26:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-10 11:26:04,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 11:26:04,954 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 11:26:04,954 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 11:26:04,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 11:26:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash 880070438, now seen corresponding path program 1 times [2018-10-10 11:26:04,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 11:26:04,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 11:26:04,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:04,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:04,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 11:26:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:05,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 11:26:05,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 11:26:05,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 11:26:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 11:26:05,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 11:26:05,285 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:26:05,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 11:26:05,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 11:26:05,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-10-10 11:26:05,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 11:26:05,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 11:26:05,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-10-10 11:26:05,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-10-10 11:26:05,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-10 11:26:05,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:18 [2018-10-10 11:26:05,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-10 11:26:05,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-10 11:26:05,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 11:26:05,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-10-10 11:26:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 11:26:05,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 11:26:05,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-10-10 11:26:05,713 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_~head~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_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_main_~head~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~head~0.base_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~head~0.offset_1), (= 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_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:05,716 INFO L168 Benchmark]: Toolchain (without parser) took 30897.51 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -984.0 MB). Peak memory consumption was 98.7 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:05,717 INFO L168 Benchmark]: CDTParser took 0.23 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:05,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.61 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:05,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.16 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:05,718 INFO L168 Benchmark]: Boogie Preprocessor took 136.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:05,719 INFO L168 Benchmark]: RCFGBuilder took 1150.20 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: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:05,720 INFO L168 Benchmark]: TraceAbstraction took 29016.24 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 326.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -223.8 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2018-10-10 11:26:05,724 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 504.61 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 85.16 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 136.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -846.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1150.20 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: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29016.24 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 326.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -223.8 MB). Peak memory consumption was 102.9 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_~head~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_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_main_~head~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~head~0.base_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~head~0.offset_1), (= 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_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_~head~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_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_main_~head~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|), (= |v_ULTIMATE.start_#Ultimate.alloc_~size_1| 8), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.base_1| v_ULTIMATE.start_main_~head~0.base_1), (= |v_ULTIMATE.start_write~$Pointer$_old_#memory_$Pointer$.offset_1| |v_#memory_$Pointer$.offset_1|), (= |v_ULTIMATE.start_main_old_#valid_1| |v_#valid_4|), (= |v_ULTIMATE.start_#Ultimate.alloc_#res.offset_1| 0), (= |v_ULTIMATE.start_write~$Pointer$_#ptr.offset_1| v_ULTIMATE.start_main_~head~0.offset_1), (= 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_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...