java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-c5b1954-m
[2018-10-10 14:54:33,778 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-10-10 14:54:33,780 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-10 14:54:33,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-10 14:54:33,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-10 14:54:33,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-10 14:54:33,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-10 14:54:33,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-10 14:54:33,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-10 14:54:33,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-10 14:54:33,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-10 14:54:33,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-10 14:54:33,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-10 14:54:33,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-10 14:54:33,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-10 14:54:33,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-10 14:54:33,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-10 14:54:33,808 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-10 14:54:33,810 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-10 14:54:33,812 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-10 14:54:33,813 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-10 14:54:33,814 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-10 14:54:33,817 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-10 14:54:33,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-10 14:54:33,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-10 14:54:33,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-10 14:54:33,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-10 14:54:33,820 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-10 14:54:33,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-10 14:54:33,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-10 14:54:33,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-10 14:54:33,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-10 14:54:33,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-10 14:54:33,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-10 14:54:33,825 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-10 14:54:33,825 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-10-10 14:54:33,826 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2018-10-10 14:54:33,848 INFO L110 SettingsManager]: Loading preferences was successful
[2018-10-10 14:54:33,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-10 14:54:33,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-10-10 14:54:33,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-10-10 14:54:33,853 INFO L133 SettingsManager]: * Use SBE=true
[2018-10-10 14:54:33,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-10 14:54:33,853 INFO L133 SettingsManager]: * sizeof long=4
[2018-10-10 14:54:33,853 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-10-10 14:54:33,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-10-10 14:54:33,854 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-10-10 14:54:33,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-10-10 14:54:33,854 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-10-10 14:54:33,854 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-10-10 14:54:33,855 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-10-10 14:54:33,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-10 14:54:33,855 INFO L133 SettingsManager]: * sizeof long double=12
[2018-10-10 14:54:33,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-10 14:54:33,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-10-10 14:54:33,856 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-10-10 14:54:33,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-10-10 14:54:33,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-10 14:54:33,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-10 14:54:33,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-10-10 14:54:33,857 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-10-10 14:54:33,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-10 14:54:33,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false
[2018-10-10 14:54:33,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-10 14:54:33,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-10 14:54:33,946 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-10 14:54:33,948 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-10-10 14:54:33,948 INFO L276 PluginConnector]: CDTParser initialized
[2018-10-10 14:54:33,949 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i
[2018-10-10 14:54:34,285 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3f5f0ee/b19492085834445d8d9c10bb575354d7/FLAG9aa9e4ae3
[2018-10-10 14:54:34,599 INFO L289 CDTParser]: Found 1 translation units.
[2018-10-10 14:54:34,600 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i
[2018-10-10 14:54:34,616 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3f5f0ee/b19492085834445d8d9c10bb575354d7/FLAG9aa9e4ae3
[2018-10-10 14:54:34,631 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3f5f0ee/b19492085834445d8d9c10bb575354d7
[2018-10-10 14:54:34,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-10 14:54:34,648 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2018-10-10 14:54:34,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-10-10 14:54:34,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-10-10 14:54:34,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-10-10 14:54:34,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:34" (1/1) ...
[2018-10-10 14:54:34,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22674479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:34, skipping insertion in model container
[2018-10-10 14:54:34,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:54:34" (1/1) ...
[2018-10-10 14:54:34,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2018-10-10 14:54:34,723 INFO L174 MainTranslator]: Built tables and reachable declarations
[2018-10-10 14:54:34,983 INFO L202 PostProcessor]: Analyzing one entry point: main
[2018-10-10 14:54:34,994 INFO L189 MainTranslator]: Completed pre-run
[2018-10-10 14:54:35,050 INFO L202 PostProcessor]: Analyzing one entry point: main
[2018-10-10 14:54:35,105 INFO L193 MainTranslator]: Completed translation
[2018-10-10 14:54:35,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35 WrapperNode
[2018-10-10 14:54:35,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-10-10 14:54:35,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-10 14:54:35,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-10 14:54:35,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-10 14:54:35,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,168 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-10 14:54:35,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-10 14:54:35,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-10 14:54:35,169 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-10-10 14:54:35,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (1/1) ...
[2018-10-10 14:54:35,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-10 14:54:35,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-10 14:54:35,296 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-10-10 14:54:35,296 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-10-10 14:54:35,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54: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 14:54:35,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-10-10 14:54:35,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-10-10 14:54:36,616 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-10-10 14:54:36,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:36 BoogieIcfgContainer
[2018-10-10 14:54:36,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-10 14:54:36,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-10 14:54:36,618 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-10-10 14:54:36,622 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-10-10 14:54:36,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:54:34" (1/3) ...
[2018-10-10 14:54:36,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688e0ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:36, skipping insertion in model container
[2018-10-10 14:54:36,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:54:35" (2/3) ...
[2018-10-10 14:54:36,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688e0ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:54:36, skipping insertion in model container
[2018-10-10 14:54:36,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:54:36" (3/3) ...
[2018-10-10 14:54:36,626 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i
[2018-10-10 14:54:36,636 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-10 14:54:36,645 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations.
[2018-10-10 14:54:36,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 27 error locations.
[2018-10-10 14:54:36,691 INFO L133 ementStrategyFactory]: Using default assertion order modulation
[2018-10-10 14:54:36,692 INFO L382 AbstractCegarLoop]: Interprodecural is true
[2018-10-10 14:54:36,692 INFO L383 AbstractCegarLoop]: Hoare is false
[2018-10-10 14:54:36,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-10 14:54:36,693 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-10 14:54:36,695 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-10 14:54:36,695 INFO L387 AbstractCegarLoop]: Difference is false
[2018-10-10 14:54:36,695 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-10 14:54:36,695 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-10 14:54:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states.
[2018-10-10 14:54:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-10-10 14:54:36,728 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:36,729 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]
[2018-10-10 14:54:36,732 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:36,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1413928972, now seen corresponding path program 1 times
[2018-10-10 14:54:36,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:36,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:36,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:36,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:36,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-10 14:54:36,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-10-10 14:54:36,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-10-10 14:54:36,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-10-10 14:54:36,906 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 2 states.
[2018-10-10 14:54:36,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:36,939 INFO L93 Difference]: Finished difference Result 245 states and 250 transitions.
[2018-10-10 14:54:36,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2018-10-10 14:54:36,940 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30
[2018-10-10 14:54:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:36,967 INFO L225 Difference]: With dead ends: 245
[2018-10-10 14:54:36,967 INFO L226 Difference]: Without dead ends: 227
[2018-10-10 14:54:36,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-10-10 14:54:36,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states.
[2018-10-10 14:54:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227.
[2018-10-10 14:54:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states.
[2018-10-10 14:54:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions.
[2018-10-10 14:54:37,052 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 30
[2018-10-10 14:54:37,052 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:37,053 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions.
[2018-10-10 14:54:37,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-10-10 14:54:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions.
[2018-10-10 14:54:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-10-10 14:54:37,054 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:37,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:37,056 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:37,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:37,056 INFO L82 PathProgramCache]: Analyzing trace with hash -838843845, now seen corresponding path program 1 times
[2018-10-10 14:54:37,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:37,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:37,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:37,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:37,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:37,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:37,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-10-10 14:54:37,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-10 14:54:37,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-10 14:54:37,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-10 14:54:37,372 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 7 states.
[2018-10-10 14:54:37,747 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18
[2018-10-10 14:54:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:39,149 INFO L93 Difference]: Finished difference Result 491 states and 503 transitions.
[2018-10-10 14:54:39,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-10 14:54:39,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33
[2018-10-10 14:54:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:39,156 INFO L225 Difference]: With dead ends: 491
[2018-10-10 14:54:39,157 INFO L226 Difference]: Without dead ends: 491
[2018-10-10 14:54:39,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:54:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states.
[2018-10-10 14:54:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 322.
[2018-10-10 14:54:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states.
[2018-10-10 14:54:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 343 transitions.
[2018-10-10 14:54:39,184 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 343 transitions. Word has length 33
[2018-10-10 14:54:39,184 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:39,184 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 343 transitions.
[2018-10-10 14:54:39,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-10 14:54:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 343 transitions.
[2018-10-10 14:54:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-10-10 14:54:39,186 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:39,186 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:39,187 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:39,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash -234355245, now seen corresponding path program 1 times
[2018-10-10 14:54:39,188 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:39,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:39,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:39,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:39,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-10-10 14:54:39,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-10 14:54:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-10 14:54:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-10-10 14:54:39,403 INFO L87 Difference]: Start difference. First operand 322 states and 343 transitions. Second operand 9 states.
[2018-10-10 14:54:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:40,328 INFO L93 Difference]: Finished difference Result 490 states and 500 transitions.
[2018-10-10 14:54:40,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-10 14:54:40,329 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34
[2018-10-10 14:54:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:40,333 INFO L225 Difference]: With dead ends: 490
[2018-10-10 14:54:40,333 INFO L226 Difference]: Without dead ends: 490
[2018-10-10 14:54:40,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240
[2018-10-10 14:54:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states.
[2018-10-10 14:54:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 324.
[2018-10-10 14:54:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states.
[2018-10-10 14:54:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 343 transitions.
[2018-10-10 14:54:40,368 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 343 transitions. Word has length 34
[2018-10-10 14:54:40,368 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:40,368 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 343 transitions.
[2018-10-10 14:54:40,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-10 14:54:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 343 transitions.
[2018-10-10 14:54:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-10-10 14:54:40,374 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:40,376 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:40,379 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:40,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:40,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2076531939, now seen corresponding path program 1 times
[2018-10-10 14:54:40,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:40,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:40,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:40,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:40,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:40,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:40,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-10-10 14:54:40,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-10 14:54:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-10 14:54:40,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-10 14:54:40,656 INFO L87 Difference]: Start difference. First operand 324 states and 343 transitions. Second operand 7 states.
[2018-10-10 14:54:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:41,390 INFO L93 Difference]: Finished difference Result 649 states and 663 transitions.
[2018-10-10 14:54:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-10-10 14:54:41,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45
[2018-10-10 14:54:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:41,395 INFO L225 Difference]: With dead ends: 649
[2018-10-10 14:54:41,395 INFO L226 Difference]: Without dead ends: 649
[2018-10-10 14:54:41,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:54:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states.
[2018-10-10 14:54:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 346.
[2018-10-10 14:54:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states.
[2018-10-10 14:54:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 367 transitions.
[2018-10-10 14:54:41,407 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 367 transitions. Word has length 45
[2018-10-10 14:54:41,408 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:41,408 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 367 transitions.
[2018-10-10 14:54:41,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-10 14:54:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 367 transitions.
[2018-10-10 14:54:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2018-10-10 14:54:41,410 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:41,410 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:41,411 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:41,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:41,411 INFO L82 PathProgramCache]: Analyzing trace with hash -52019139, now seen corresponding path program 1 times
[2018-10-10 14:54:41,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:41,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:41,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:41,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:41,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:41,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-10-10 14:54:41,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-10 14:54:41,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-10 14:54:41,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-10-10 14:54:41,618 INFO L87 Difference]: Start difference. First operand 346 states and 367 transitions. Second operand 9 states.
[2018-10-10 14:54:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:42,370 INFO L93 Difference]: Finished difference Result 503 states and 513 transitions.
[2018-10-10 14:54:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-10 14:54:42,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46
[2018-10-10 14:54:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:42,374 INFO L225 Difference]: With dead ends: 503
[2018-10-10 14:54:42,375 INFO L226 Difference]: Without dead ends: 503
[2018-10-10 14:54:42,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240
[2018-10-10 14:54:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states.
[2018-10-10 14:54:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 348.
[2018-10-10 14:54:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states.
[2018-10-10 14:54:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 367 transitions.
[2018-10-10 14:54:42,385 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 367 transitions. Word has length 46
[2018-10-10 14:54:42,386 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:42,386 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 367 transitions.
[2018-10-10 14:54:42,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-10 14:54:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 367 transitions.
[2018-10-10 14:54:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-10-10 14:54:42,388 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:42,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:42,389 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:42,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash -170444492, now seen corresponding path program 1 times
[2018-10-10 14:54:42,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:42,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:42,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:42,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:42,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:42,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:42,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-10 14:54:42,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-10 14:54:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-10 14:54:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-10 14:54:42,472 INFO L87 Difference]: Start difference. First operand 348 states and 367 transitions. Second operand 3 states.
[2018-10-10 14:54:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:42,580 INFO L93 Difference]: Finished difference Result 542 states and 567 transitions.
[2018-10-10 14:54:42,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-10-10 14:54:42,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59
[2018-10-10 14:54:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:42,583 INFO L225 Difference]: With dead ends: 542
[2018-10-10 14:54:42,584 INFO L226 Difference]: Without dead ends: 542
[2018-10-10 14:54:42,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:54:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states.
[2018-10-10 14:54:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 431.
[2018-10-10 14:54:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states.
[2018-10-10 14:54:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 463 transitions.
[2018-10-10 14:54:42,595 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 463 transitions. Word has length 59
[2018-10-10 14:54:42,595 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:42,596 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 463 transitions.
[2018-10-10 14:54:42,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-10 14:54:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 463 transitions.
[2018-10-10 14:54:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2018-10-10 14:54:42,597 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:42,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:42,598 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:42,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:42,599 INFO L82 PathProgramCache]: Analyzing trace with hash -768080396, now seen corresponding path program 1 times
[2018-10-10 14:54:42,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:42,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:42,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:42,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:42,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:42,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-10-10 14:54:42,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-10 14:54:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-10 14:54:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2018-10-10 14:54:42,787 INFO L87 Difference]: Start difference. First operand 431 states and 463 transitions. Second operand 9 states.
[2018-10-10 14:54:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:44,655 INFO L93 Difference]: Finished difference Result 581 states and 606 transitions.
[2018-10-10 14:54:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-10-10 14:54:44,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59
[2018-10-10 14:54:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:44,659 INFO L225 Difference]: With dead ends: 581
[2018-10-10 14:54:44,660 INFO L226 Difference]: Without dead ends: 581
[2018-10-10 14:54:44,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272
[2018-10-10 14:54:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states.
[2018-10-10 14:54:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 455.
[2018-10-10 14:54:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states.
[2018-10-10 14:54:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 487 transitions.
[2018-10-10 14:54:44,672 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 487 transitions. Word has length 59
[2018-10-10 14:54:44,672 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:44,672 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 487 transitions.
[2018-10-10 14:54:44,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-10 14:54:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 487 transitions.
[2018-10-10 14:54:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2018-10-10 14:54:44,674 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:44,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:44,675 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:44,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:44,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1959311645, now seen corresponding path program 1 times
[2018-10-10 14:54:44,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:44,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:44,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:44,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:44,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:45,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:45,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-10-10 14:54:45,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-10-10 14:54:45,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-10-10 14:54:45,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2018-10-10 14:54:45,129 INFO L87 Difference]: Start difference. First operand 455 states and 487 transitions. Second operand 13 states.
[2018-10-10 14:54:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:46,933 INFO L93 Difference]: Finished difference Result 831 states and 865 transitions.
[2018-10-10 14:54:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-10-10 14:54:46,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60
[2018-10-10 14:54:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:46,939 INFO L225 Difference]: With dead ends: 831
[2018-10-10 14:54:46,939 INFO L226 Difference]: Without dead ends: 831
[2018-10-10 14:54:46,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756
[2018-10-10 14:54:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states.
[2018-10-10 14:54:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 456.
[2018-10-10 14:54:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states.
[2018-10-10 14:54:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 488 transitions.
[2018-10-10 14:54:46,951 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 488 transitions. Word has length 60
[2018-10-10 14:54:46,951 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:46,951 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 488 transitions.
[2018-10-10 14:54:46,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-10-10 14:54:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 488 transitions.
[2018-10-10 14:54:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-10-10 14:54:46,952 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:46,953 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:46,953 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:46,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 275205410, now seen corresponding path program 1 times
[2018-10-10 14:54:46,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:46,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:46,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:47,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:47,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-10-10 14:54:47,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-10-10 14:54:47,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-10-10 14:54:47,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-10-10 14:54:47,119 INFO L87 Difference]: Start difference. First operand 456 states and 488 transitions. Second operand 6 states.
[2018-10-10 14:54:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:47,430 INFO L93 Difference]: Finished difference Result 509 states and 542 transitions.
[2018-10-10 14:54:47,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-10-10 14:54:47,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68
[2018-10-10 14:54:47,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:47,447 INFO L225 Difference]: With dead ends: 509
[2018-10-10 14:54:47,447 INFO L226 Difference]: Without dead ends: 509
[2018-10-10 14:54:47,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-10-10 14:54:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states.
[2018-10-10 14:54:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 455.
[2018-10-10 14:54:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states.
[2018-10-10 14:54:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 486 transitions.
[2018-10-10 14:54:47,465 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 486 transitions. Word has length 68
[2018-10-10 14:54:47,465 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:47,465 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 486 transitions.
[2018-10-10 14:54:47,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-10-10 14:54:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 486 transitions.
[2018-10-10 14:54:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2018-10-10 14:54:47,466 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:47,466 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:47,472 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:47,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:47,473 INFO L82 PathProgramCache]: Analyzing trace with hash -58566726, now seen corresponding path program 1 times
[2018-10-10 14:54:47,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:47,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:47,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:47,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:47,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:48,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:48,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-10-10 14:54:48,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-10-10 14:54:48,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-10-10 14:54:48,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2018-10-10 14:54:48,189 INFO L87 Difference]: Start difference. First operand 455 states and 486 transitions. Second operand 10 states.
[2018-10-10 14:54:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:48,786 INFO L93 Difference]: Finished difference Result 692 states and 730 transitions.
[2018-10-10 14:54:48,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-10-10 14:54:48,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69
[2018-10-10 14:54:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:48,790 INFO L225 Difference]: With dead ends: 692
[2018-10-10 14:54:48,790 INFO L226 Difference]: Without dead ends: 692
[2018-10-10 14:54:48,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420
[2018-10-10 14:54:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states.
[2018-10-10 14:54:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 478.
[2018-10-10 14:54:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states.
[2018-10-10 14:54:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 512 transitions.
[2018-10-10 14:54:48,801 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 512 transitions. Word has length 69
[2018-10-10 14:54:48,801 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:48,801 INFO L481 AbstractCegarLoop]: Abstraction has 478 states and 512 transitions.
[2018-10-10 14:54:48,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-10-10 14:54:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 512 transitions.
[2018-10-10 14:54:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2018-10-10 14:54:48,802 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:48,802 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:48,803 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:48,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:48,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1966787691, now seen corresponding path program 1 times
[2018-10-10 14:54:48,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:48,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:48,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:48,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:48,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:48,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:48,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-10-10 14:54:48,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-10 14:54:48,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-10 14:54:48,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-10 14:54:48,951 INFO L87 Difference]: Start difference. First operand 478 states and 512 transitions. Second operand 7 states.
[2018-10-10 14:54:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:49,498 INFO L93 Difference]: Finished difference Result 590 states and 615 transitions.
[2018-10-10 14:54:49,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-10 14:54:49,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71
[2018-10-10 14:54:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:49,502 INFO L225 Difference]: With dead ends: 590
[2018-10-10 14:54:49,502 INFO L226 Difference]: Without dead ends: 590
[2018-10-10 14:54:49,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:54:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states.
[2018-10-10 14:54:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 494.
[2018-10-10 14:54:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states.
[2018-10-10 14:54:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 528 transitions.
[2018-10-10 14:54:49,512 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 528 transitions. Word has length 71
[2018-10-10 14:54:49,512 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:49,512 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 528 transitions.
[2018-10-10 14:54:49,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-10 14:54:49,513 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 528 transitions.
[2018-10-10 14:54:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2018-10-10 14:54:49,513 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:49,514 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:49,514 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:49,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash -840876020, now seen corresponding path program 1 times
[2018-10-10 14:54:49,515 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:49,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:49,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:49,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:50,021 WARN L178 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12
[2018-10-10 14:54:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:50,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:50,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-10-10 14:54:50,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-10-10 14:54:50,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-10-10 14:54:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-10-10 14:54:50,061 INFO L87 Difference]: Start difference. First operand 494 states and 528 transitions. Second operand 9 states.
[2018-10-10 14:54:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:50,776 INFO L93 Difference]: Finished difference Result 586 states and 601 transitions.
[2018-10-10 14:54:50,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-10 14:54:50,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72
[2018-10-10 14:54:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:50,780 INFO L225 Difference]: With dead ends: 586
[2018-10-10 14:54:50,780 INFO L226 Difference]: Without dead ends: 572
[2018-10-10 14:54:50,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272
[2018-10-10 14:54:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states.
[2018-10-10 14:54:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 398.
[2018-10-10 14:54:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states.
[2018-10-10 14:54:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 416 transitions.
[2018-10-10 14:54:50,788 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 416 transitions. Word has length 72
[2018-10-10 14:54:50,788 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:50,789 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 416 transitions.
[2018-10-10 14:54:50,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-10-10 14:54:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 416 transitions.
[2018-10-10 14:54:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-10-10 14:54:50,790 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:50,790 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:50,791 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:50,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1614807709, now seen corresponding path program 1 times
[2018-10-10 14:54:50,791 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:50,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:50,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:50,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:50,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:50,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-10-10 14:54:50,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-10-10 14:54:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-10-10 14:54:50,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2018-10-10 14:54:50,946 INFO L87 Difference]: Start difference. First operand 398 states and 416 transitions. Second operand 11 states.
[2018-10-10 14:54:51,468 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16
[2018-10-10 14:54:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:52,361 INFO L93 Difference]: Finished difference Result 533 states and 547 transitions.
[2018-10-10 14:54:52,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-10-10 14:54:52,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73
[2018-10-10 14:54:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:52,364 INFO L225 Difference]: With dead ends: 533
[2018-10-10 14:54:52,364 INFO L226 Difference]: Without dead ends: 533
[2018-10-10 14:54:52,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380
[2018-10-10 14:54:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states.
[2018-10-10 14:54:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 419.
[2018-10-10 14:54:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states.
[2018-10-10 14:54:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 441 transitions.
[2018-10-10 14:54:52,372 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 441 transitions. Word has length 73
[2018-10-10 14:54:52,372 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:52,372 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 441 transitions.
[2018-10-10 14:54:52,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-10-10 14:54:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 441 transitions.
[2018-10-10 14:54:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2018-10-10 14:54:52,373 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:52,373 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:52,374 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:52,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:52,374 INFO L82 PathProgramCache]: Analyzing trace with hash -521877769, now seen corresponding path program 1 times
[2018-10-10 14:54:52,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:52,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:52,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:52,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:52,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-10-10 14:54:52,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-10-10 14:54:52,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-10-10 14:54:52,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-10-10 14:54:52,637 INFO L87 Difference]: Start difference. First operand 419 states and 441 transitions. Second operand 11 states.
[2018-10-10 14:54:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:53,252 INFO L93 Difference]: Finished difference Result 427 states and 448 transitions.
[2018-10-10 14:54:53,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-10-10 14:54:53,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78
[2018-10-10 14:54:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:53,255 INFO L225 Difference]: With dead ends: 427
[2018-10-10 14:54:53,256 INFO L226 Difference]: Without dead ends: 377
[2018-10-10 14:54:53,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462
[2018-10-10 14:54:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states.
[2018-10-10 14:54:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377.
[2018-10-10 14:54:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states.
[2018-10-10 14:54:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 398 transitions.
[2018-10-10 14:54:53,263 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 398 transitions. Word has length 78
[2018-10-10 14:54:53,264 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:53,264 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 398 transitions.
[2018-10-10 14:54:53,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-10-10 14:54:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 398 transitions.
[2018-10-10 14:54:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2018-10-10 14:54:53,265 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:53,265 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:53,266 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:53,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash 910654628, now seen corresponding path program 1 times
[2018-10-10 14:54:53,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:53,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:53,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:54:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-10-10 14:54:53,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-10-10 14:54:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-10-10 14:54:53,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2018-10-10 14:54:53,493 INFO L87 Difference]: Start difference. First operand 377 states and 398 transitions. Second operand 12 states.
[2018-10-10 14:54:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:54:54,614 INFO L93 Difference]: Finished difference Result 444 states and 459 transitions.
[2018-10-10 14:54:54,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-10-10 14:54:54,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85
[2018-10-10 14:54:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:54:54,617 INFO L225 Difference]: With dead ends: 444
[2018-10-10 14:54:54,617 INFO L226 Difference]: Without dead ends: 444
[2018-10-10 14:54:54,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756
[2018-10-10 14:54:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states.
[2018-10-10 14:54:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 374.
[2018-10-10 14:54:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states.
[2018-10-10 14:54:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 395 transitions.
[2018-10-10 14:54:54,624 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 395 transitions. Word has length 85
[2018-10-10 14:54:54,624 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:54:54,625 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 395 transitions.
[2018-10-10 14:54:54,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-10-10 14:54:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 395 transitions.
[2018-10-10 14:54:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2018-10-10 14:54:54,626 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:54:54,626 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:54:54,627 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:54:54,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:54:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1834477430, now seen corresponding path program 1 times
[2018-10-10 14:54:54,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:54:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:54:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:54,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:54:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:55,462 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24
[2018-10-10 14:54:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:55,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:54:55,683 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:54:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:54:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:54:55,763 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:54:56,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:54:56,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-10-10 14:54:56,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:54:56,491 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 10 treesize of output 9
[2018-10-10 14:54:56,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:54:56,505 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 10 treesize of output 9
[2018-10-10 14:54:56,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,515 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21
[2018-10-10 14:54:56,602 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 17 treesize of output 13
[2018-10-10 14:54:56,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-10-10 14:54:56,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:54:56,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:54:56,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:54:56,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9
[2018-10-10 14:54:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:54:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-10-10 14:54:56,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [23] total 31
[2018-10-10 14:54:56,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-10-10 14:54:56,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-10-10 14:54:56,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992
[2018-10-10 14:54:56,766 INFO L87 Difference]: Start difference. First operand 374 states and 395 transitions. Second operand 32 states.
[2018-10-10 14:54:57,447 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40
[2018-10-10 14:54:57,858 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54
[2018-10-10 14:54:58,758 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52
[2018-10-10 14:54:58,937 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54
[2018-10-10 14:54:59,213 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63
[2018-10-10 14:54:59,588 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80
[2018-10-10 14:55:00,010 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85
[2018-10-10 14:55:00,426 WARN L178 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90
[2018-10-10 14:55:00,616 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61
[2018-10-10 14:55:00,833 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56
[2018-10-10 14:55:01,113 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64
[2018-10-10 14:55:01,577 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59
[2018-10-10 14:55:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:04,181 INFO L93 Difference]: Finished difference Result 566 states and 582 transitions.
[2018-10-10 14:55:04,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-10-10 14:55:04,182 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86
[2018-10-10 14:55:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:04,186 INFO L225 Difference]: With dead ends: 566
[2018-10-10 14:55:04,186 INFO L226 Difference]: Without dead ends: 566
[2018-10-10 14:55:04,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 962 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=923, Invalid=4333, Unknown=0, NotChecked=0, Total=5256
[2018-10-10 14:55:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states.
[2018-10-10 14:55:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 371.
[2018-10-10 14:55:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states.
[2018-10-10 14:55:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 392 transitions.
[2018-10-10 14:55:04,195 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 392 transitions. Word has length 86
[2018-10-10 14:55:04,196 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:04,196 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 392 transitions.
[2018-10-10 14:55:04,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-10-10 14:55:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 392 transitions.
[2018-10-10 14:55:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2018-10-10 14:55:04,197 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:04,197 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:04,198 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:04,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash 885211596, now seen corresponding path program 1 times
[2018-10-10 14:55:04,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:04,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:04,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:04,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:04,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:04,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:04,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:04,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:04,769 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:04,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:04,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6
[2018-10-10 14:55:04,947 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_17.bpl
[2018-10-10 14:55:04,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-10 14:55:04,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-10 14:55:04,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-10 14:55:04,962 INFO L87 Difference]: Start difference. First operand 371 states and 392 transitions. Second operand 7 states.
[2018-10-10 14:55:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:05,655 INFO L93 Difference]: Finished difference Result 760 states and 787 transitions.
[2018-10-10 14:55:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-10-10 14:55:05,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97
[2018-10-10 14:55:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:05,658 INFO L225 Difference]: With dead ends: 760
[2018-10-10 14:55:05,658 INFO L226 Difference]: Without dead ends: 760
[2018-10-10 14:55:05,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:55:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states.
[2018-10-10 14:55:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 522.
[2018-10-10 14:55:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states.
[2018-10-10 14:55:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 564 transitions.
[2018-10-10 14:55:05,667 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 564 transitions. Word has length 97
[2018-10-10 14:55:05,667 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:05,667 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 564 transitions.
[2018-10-10 14:55:05,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-10 14:55:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 564 transitions.
[2018-10-10 14:55:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2018-10-10 14:55:05,668 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:05,669 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:05,669 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:05,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1671755892, now seen corresponding path program 1 times
[2018-10-10 14:55:05,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:05,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:05,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:05,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:05,877 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:05,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:05,926 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:06,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:06,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13
[2018-10-10 14:55:06,243 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_18.bpl
[2018-10-10 14:55:06,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-10-10 14:55:06,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-10-10 14:55:06,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:55:06,245 INFO L87 Difference]: Start difference. First operand 522 states and 564 transitions. Second operand 14 states.
[2018-10-10 14:55:07,931 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 19
[2018-10-10 14:55:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:08,402 INFO L93 Difference]: Finished difference Result 1032 states and 1061 transitions.
[2018-10-10 14:55:08,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2018-10-10 14:55:08,403 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98
[2018-10-10 14:55:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:08,406 INFO L225 Difference]: With dead ends: 1032
[2018-10-10 14:55:08,406 INFO L226 Difference]: Without dead ends: 1032
[2018-10-10 14:55:08,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=413, Invalid=1069, Unknown=0, NotChecked=0, Total=1482
[2018-10-10 14:55:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states.
[2018-10-10 14:55:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 523.
[2018-10-10 14:55:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states.
[2018-10-10 14:55:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 561 transitions.
[2018-10-10 14:55:08,418 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 561 transitions. Word has length 98
[2018-10-10 14:55:08,418 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:08,418 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 561 transitions.
[2018-10-10 14:55:08,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-10-10 14:55:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 561 transitions.
[2018-10-10 14:55:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2018-10-10 14:55:08,420 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:08,420 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:08,421 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:08,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:08,421 INFO L82 PathProgramCache]: Analyzing trace with hash -479604131, now seen corresponding path program 1 times
[2018-10-10 14:55:08,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:08,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:08,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:08,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:08,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2018-10-10 14:55:08,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:55:08,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-10-10 14:55:08,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-10 14:55:08,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-10 14:55:08,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-10-10 14:55:08,587 INFO L87 Difference]: Start difference. First operand 523 states and 561 transitions. Second operand 8 states.
[2018-10-10 14:55:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:08,870 INFO L93 Difference]: Finished difference Result 554 states and 589 transitions.
[2018-10-10 14:55:08,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-10-10 14:55:08,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111
[2018-10-10 14:55:08,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:08,874 INFO L225 Difference]: With dead ends: 554
[2018-10-10 14:55:08,874 INFO L226 Difference]: Without dead ends: 554
[2018-10-10 14:55:08,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156
[2018-10-10 14:55:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states.
[2018-10-10 14:55:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 522.
[2018-10-10 14:55:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states.
[2018-10-10 14:55:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 559 transitions.
[2018-10-10 14:55:08,882 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 559 transitions. Word has length 111
[2018-10-10 14:55:08,882 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:08,883 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 559 transitions.
[2018-10-10 14:55:08,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-10 14:55:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 559 transitions.
[2018-10-10 14:55:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2018-10-10 14:55:08,884 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:08,884 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:08,885 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:08,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1982826028, now seen corresponding path program 1 times
[2018-10-10 14:55:08,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:08,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:08,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:09,404 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 13
[2018-10-10 14:55:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-10-10 14:55:10,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:10,660 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:10,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:10,706 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:10,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:55:10,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:10,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:10,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-10-10 14:55:11,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:55:11,103 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 10 treesize of output 9
[2018-10-10 14:55:11,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:55:11,123 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 10 treesize of output 9
[2018-10-10 14:55:11,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:21
[2018-10-10 14:55:11,221 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 17 treesize of output 13
[2018-10-10 14:55:11,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-10-10 14:55:11,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:55:11,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-10-10 14:55:11,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9
[2018-10-10 14:55:11,573 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:11,573 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:11,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:55:11,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13
[2018-10-10 14:55:11,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-10-10 14:55:11,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:11,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9
[2018-10-10 14:55:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:11,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:11,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 43
[2018-10-10 14:55:11,698 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_20.bpl
[2018-10-10 14:55:11,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-10-10 14:55:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-10-10 14:55:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892
[2018-10-10 14:55:11,700 INFO L87 Difference]: Start difference. First operand 522 states and 559 transitions. Second operand 44 states.
[2018-10-10 14:55:12,472 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48
[2018-10-10 14:55:13,454 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54
[2018-10-10 14:55:13,646 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56
[2018-10-10 14:55:13,910 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65
[2018-10-10 14:55:14,193 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82
[2018-10-10 14:55:14,537 WARN L178 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 87
[2018-10-10 14:55:14,856 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 92
[2018-10-10 14:55:15,056 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69
[2018-10-10 14:55:15,264 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64
[2018-10-10 14:55:15,501 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68
[2018-10-10 14:55:15,742 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70
[2018-10-10 14:55:16,070 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58
[2018-10-10 14:55:16,312 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76
[2018-10-10 14:55:16,557 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69
[2018-10-10 14:55:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:18,230 INFO L93 Difference]: Finished difference Result 613 states and 645 transitions.
[2018-10-10 14:55:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states.
[2018-10-10 14:55:18,230 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 112
[2018-10-10 14:55:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:18,233 INFO L225 Difference]: With dead ends: 613
[2018-10-10 14:55:18,233 INFO L226 Difference]: Without dead ends: 613
[2018-10-10 14:55:18,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=932, Invalid=4470, Unknown=0, NotChecked=0, Total=5402
[2018-10-10 14:55:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states.
[2018-10-10 14:55:18,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 521.
[2018-10-10 14:55:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states.
[2018-10-10 14:55:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 557 transitions.
[2018-10-10 14:55:18,242 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 557 transitions. Word has length 112
[2018-10-10 14:55:18,243 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:18,243 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 557 transitions.
[2018-10-10 14:55:18,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-10-10 14:55:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 557 transitions.
[2018-10-10 14:55:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2018-10-10 14:55:18,244 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:18,244 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:18,245 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:18,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:18,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1420981475, now seen corresponding path program 1 times
[2018-10-10 14:55:18,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:18,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:18,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:18,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:18,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2018-10-10 14:55:18,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:55:18,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-10-10 14:55:18,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-10-10 14:55:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-10-10 14:55:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-10-10 14:55:18,390 INFO L87 Difference]: Start difference. First operand 521 states and 557 transitions. Second operand 6 states.
[2018-10-10 14:55:18,608 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 19
[2018-10-10 14:55:18,921 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 26
[2018-10-10 14:55:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:19,124 INFO L93 Difference]: Finished difference Result 520 states and 555 transitions.
[2018-10-10 14:55:19,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-10-10 14:55:19,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121
[2018-10-10 14:55:19,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:19,127 INFO L225 Difference]: With dead ends: 520
[2018-10-10 14:55:19,128 INFO L226 Difference]: Without dead ends: 520
[2018-10-10 14:55:19,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-10-10 14:55:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states.
[2018-10-10 14:55:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520.
[2018-10-10 14:55:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states.
[2018-10-10 14:55:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 555 transitions.
[2018-10-10 14:55:19,134 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 555 transitions. Word has length 121
[2018-10-10 14:55:19,134 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:19,134 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 555 transitions.
[2018-10-10 14:55:19,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-10-10 14:55:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 555 transitions.
[2018-10-10 14:55:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2018-10-10 14:55:19,135 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:19,135 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:19,136 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:19,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash 792090430, now seen corresponding path program 1 times
[2018-10-10 14:55:19,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:19,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:19,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:19,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:19,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:19,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:19,299 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:19,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:19,357 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:19,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:19,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6
[2018-10-10 14:55:19,498 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_22.bpl
[2018-10-10 14:55:19,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-10 14:55:19,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-10 14:55:19,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-10 14:55:19,503 INFO L87 Difference]: Start difference. First operand 520 states and 555 transitions. Second operand 7 states.
[2018-10-10 14:55:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:20,041 INFO L93 Difference]: Finished difference Result 752 states and 774 transitions.
[2018-10-10 14:55:20,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-10-10 14:55:20,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123
[2018-10-10 14:55:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:20,053 INFO L225 Difference]: With dead ends: 752
[2018-10-10 14:55:20,053 INFO L226 Difference]: Without dead ends: 752
[2018-10-10 14:55:20,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:55:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states.
[2018-10-10 14:55:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 536.
[2018-10-10 14:55:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states.
[2018-10-10 14:55:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 571 transitions.
[2018-10-10 14:55:20,062 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 571 transitions. Word has length 123
[2018-10-10 14:55:20,062 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:20,062 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 571 transitions.
[2018-10-10 14:55:20,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-10 14:55:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 571 transitions.
[2018-10-10 14:55:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2018-10-10 14:55:20,063 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:20,063 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:20,064 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:20,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1215000189, now seen corresponding path program 1 times
[2018-10-10 14:55:20,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:20,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:20,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:20,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:20,418 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:20,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:20,467 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:20,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:20,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13
[2018-10-10 14:55:20,720 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_23.bpl
[2018-10-10 14:55:20,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-10-10 14:55:20,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-10-10 14:55:20,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:55:20,722 INFO L87 Difference]: Start difference. First operand 536 states and 571 transitions. Second operand 14 states.
[2018-10-10 14:55:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:21,846 INFO L93 Difference]: Finished difference Result 1022 states and 1046 transitions.
[2018-10-10 14:55:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-10-10 14:55:21,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124
[2018-10-10 14:55:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:21,850 INFO L225 Difference]: With dead ends: 1022
[2018-10-10 14:55:21,850 INFO L226 Difference]: Without dead ends: 1022
[2018-10-10 14:55:21,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190
[2018-10-10 14:55:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states.
[2018-10-10 14:55:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 543.
[2018-10-10 14:55:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states.
[2018-10-10 14:55:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 579 transitions.
[2018-10-10 14:55:21,860 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 579 transitions. Word has length 124
[2018-10-10 14:55:21,860 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:21,860 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 579 transitions.
[2018-10-10 14:55:21,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-10-10 14:55:21,860 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 579 transitions.
[2018-10-10 14:55:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2018-10-10 14:55:21,861 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:21,861 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:21,862 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:21,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash -400760018, now seen corresponding path program 1 times
[2018-10-10 14:55:21,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:21,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:21,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:21,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:22,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:22,466 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:22,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:22,516 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:22,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:55:22,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:22,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:22,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:55:22,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-10-10 14:55:22,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-10-10 14:55:22,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:22,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:22,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:22,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19
[2018-10-10 14:55:22,732 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:22,734 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:22,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:55:22,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:22,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:22,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18
[2018-10-10 14:55:23,082 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 13 treesize of output 10
[2018-10-10 14:55:23,085 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 10 treesize of output 9
[2018-10-10 14:55:23,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24
[2018-10-10 14:55:23,212 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 20 treesize of output 16
[2018-10-10 14:55:23,215 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 16 treesize of output 4
[2018-10-10 14:55:23,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12
[2018-10-10 14:55:23,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20
[2018-10-10 14:55:23,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-10-10 14:55:23,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7
[2018-10-10 14:55:23,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:55:23,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-10-10 14:55:23,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:23,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3
[2018-10-10 14:55:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:23,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:23,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 46
[2018-10-10 14:55:23,704 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_24.bpl
[2018-10-10 14:55:23,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-10-10 14:55:23,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-10-10 14:55:23,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1924, Unknown=0, NotChecked=0, Total=2070
[2018-10-10 14:55:23,706 INFO L87 Difference]: Start difference. First operand 543 states and 579 transitions. Second operand 46 states.
[2018-10-10 14:55:25,658 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51
[2018-10-10 14:55:25,816 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54
[2018-10-10 14:55:26,807 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31
[2018-10-10 14:55:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:29,545 INFO L93 Difference]: Finished difference Result 791 states and 818 transitions.
[2018-10-10 14:55:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2018-10-10 14:55:29,546 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 130
[2018-10-10 14:55:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:29,548 INFO L225 Difference]: With dead ends: 791
[2018-10-10 14:55:29,548 INFO L226 Difference]: Without dead ends: 791
[2018-10-10 14:55:29,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=850, Invalid=6632, Unknown=0, NotChecked=0, Total=7482
[2018-10-10 14:55:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states.
[2018-10-10 14:55:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 526.
[2018-10-10 14:55:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states.
[2018-10-10 14:55:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 560 transitions.
[2018-10-10 14:55:29,556 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 560 transitions. Word has length 130
[2018-10-10 14:55:29,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:29,556 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 560 transitions.
[2018-10-10 14:55:29,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-10-10 14:55:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 560 transitions.
[2018-10-10 14:55:29,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2018-10-10 14:55:29,557 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:29,557 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:29,557 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:29,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:29,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1618766379, now seen corresponding path program 1 times
[2018-10-10 14:55:29,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:29,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:29,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:29,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:29,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:30,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:30,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:30,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:30,085 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:30,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:55:30,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12
[2018-10-10 14:55:30,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:55:30,225 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 10 treesize of output 9
[2018-10-10 14:55:30,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11
[2018-10-10 14:55:30,367 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 17 treesize of output 13
[2018-10-10 14:55:30,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-10-10 14:55:30,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:30,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5
[2018-10-10 14:55:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:30,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:30,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 25
[2018-10-10 14:55:30,457 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl
[2018-10-10 14:55:30,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-10-10 14:55:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-10-10 14:55:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650
[2018-10-10 14:55:30,459 INFO L87 Difference]: Start difference. First operand 526 states and 560 transitions. Second operand 26 states.
[2018-10-10 14:55:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:35,326 INFO L93 Difference]: Finished difference Result 1024 states and 1053 transitions.
[2018-10-10 14:55:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2018-10-10 14:55:35,326 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136
[2018-10-10 14:55:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:35,329 INFO L225 Difference]: With dead ends: 1024
[2018-10-10 14:55:35,330 INFO L226 Difference]: Without dead ends: 1024
[2018-10-10 14:55:35,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1155, Invalid=4851, Unknown=0, NotChecked=0, Total=6006
[2018-10-10 14:55:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states.
[2018-10-10 14:55:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 556.
[2018-10-10 14:55:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states.
[2018-10-10 14:55:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 593 transitions.
[2018-10-10 14:55:35,339 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 593 transitions. Word has length 136
[2018-10-10 14:55:35,339 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:35,339 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 593 transitions.
[2018-10-10 14:55:35,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-10-10 14:55:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 593 transitions.
[2018-10-10 14:55:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2018-10-10 14:55:35,340 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:35,340 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:35,341 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:35,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:35,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1357849611, now seen corresponding path program 1 times
[2018-10-10 14:55:35,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:35,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:35,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:35,836 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13
[2018-10-10 14:55:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:36,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:36,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:36,878 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:37,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:55:37,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15
[2018-10-10 14:55:37,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:55:37,174 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 10 treesize of output 9
[2018-10-10 14:55:37,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:55:37,192 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 10 treesize of output 9
[2018-10-10 14:55:37,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21
[2018-10-10 14:55:37,331 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 17 treesize of output 13
[2018-10-10 14:55:37,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-10-10 14:55:37,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:55:37,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:55:37,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:37,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9
[2018-10-10 14:55:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:37,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:37,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 15] total 38
[2018-10-10 14:55:37,526 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_26.bpl
[2018-10-10 14:55:37,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-10-10 14:55:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-10-10 14:55:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1379, Unknown=0, NotChecked=0, Total=1482
[2018-10-10 14:55:37,528 INFO L87 Difference]: Start difference. First operand 556 states and 593 transitions. Second operand 39 states.
[2018-10-10 14:55:39,130 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50
[2018-10-10 14:55:39,388 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67
[2018-10-10 14:55:39,634 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69
[2018-10-10 14:55:39,992 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83
[2018-10-10 14:55:40,355 WARN L178 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103
[2018-10-10 14:55:40,701 WARN L178 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99
[2018-10-10 14:55:41,114 WARN L178 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104
[2018-10-10 14:55:41,269 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62
[2018-10-10 14:55:41,757 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69
[2018-10-10 14:55:42,336 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61
[2018-10-10 14:55:42,723 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66
[2018-10-10 14:55:43,516 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68
[2018-10-10 14:55:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:45,920 INFO L93 Difference]: Finished difference Result 845 states and 870 transitions.
[2018-10-10 14:55:45,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2018-10-10 14:55:45,920 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 137
[2018-10-10 14:55:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:45,924 INFO L225 Difference]: With dead ends: 845
[2018-10-10 14:55:45,924 INFO L226 Difference]: Without dead ends: 845
[2018-10-10 14:55:45,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=962, Invalid=5200, Unknown=0, NotChecked=0, Total=6162
[2018-10-10 14:55:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states.
[2018-10-10 14:55:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 558.
[2018-10-10 14:55:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states.
[2018-10-10 14:55:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 594 transitions.
[2018-10-10 14:55:45,934 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 594 transitions. Word has length 137
[2018-10-10 14:55:45,934 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:45,934 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 594 transitions.
[2018-10-10 14:55:45,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-10-10 14:55:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 594 transitions.
[2018-10-10 14:55:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2018-10-10 14:55:45,935 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:45,936 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:45,936 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:45,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:45,936 INFO L82 PathProgramCache]: Analyzing trace with hash 262240117, now seen corresponding path program 1 times
[2018-10-10 14:55:45,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:45,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:45,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:45,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:45,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2018-10-10 14:55:46,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:46,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:46,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:46,270 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:46,440 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:46,441 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:46,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-10-10 14:55:46,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:46,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:55:46,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15
[2018-10-10 14:55:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:46,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:46,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13
[2018-10-10 14:55:46,731 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_27.bpl
[2018-10-10 14:55:46,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-10-10 14:55:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-10-10 14:55:46,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:55:46,736 INFO L87 Difference]: Start difference. First operand 558 states and 594 transitions. Second operand 14 states.
[2018-10-10 14:55:48,234 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22
[2018-10-10 14:55:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:48,751 INFO L93 Difference]: Finished difference Result 753 states and 775 transitions.
[2018-10-10 14:55:48,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-10-10 14:55:48,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149
[2018-10-10 14:55:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:48,754 INFO L225 Difference]: With dead ends: 753
[2018-10-10 14:55:48,754 INFO L226 Difference]: Without dead ends: 753
[2018-10-10 14:55:48,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870
[2018-10-10 14:55:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states.
[2018-10-10 14:55:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 565.
[2018-10-10 14:55:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states.
[2018-10-10 14:55:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 598 transitions.
[2018-10-10 14:55:48,761 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 598 transitions. Word has length 149
[2018-10-10 14:55:48,761 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:48,761 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 598 transitions.
[2018-10-10 14:55:48,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-10-10 14:55:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 598 transitions.
[2018-10-10 14:55:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2018-10-10 14:55:48,762 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:48,762 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:48,763 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:48,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:48,763 INFO L82 PathProgramCache]: Analyzing trace with hash -460490773, now seen corresponding path program 1 times
[2018-10-10 14:55:48,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:48,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:48,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:49,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:49,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:49,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:49,462 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:49,625 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:49,626 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:55:49,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:55:49,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:49,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:49,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13
[2018-10-10 14:55:49,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-10-10 14:55:49,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:49,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:49,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9
[2018-10-10 14:55:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:49,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:49,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 25
[2018-10-10 14:55:49,747 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_28.bpl
[2018-10-10 14:55:49,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-10-10 14:55:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-10-10 14:55:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650
[2018-10-10 14:55:49,748 INFO L87 Difference]: Start difference. First operand 565 states and 598 transitions. Second operand 26 states.
[2018-10-10 14:55:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:54,246 INFO L93 Difference]: Finished difference Result 1408 states and 1453 transitions.
[2018-10-10 14:55:54,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2018-10-10 14:55:54,247 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 150
[2018-10-10 14:55:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:54,251 INFO L225 Difference]: With dead ends: 1408
[2018-10-10 14:55:54,251 INFO L226 Difference]: Without dead ends: 1408
[2018-10-10 14:55:54,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1225, Invalid=4325, Unknown=0, NotChecked=0, Total=5550
[2018-10-10 14:55:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states.
[2018-10-10 14:55:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 810.
[2018-10-10 14:55:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states.
[2018-10-10 14:55:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 850 transitions.
[2018-10-10 14:55:54,264 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 850 transitions. Word has length 150
[2018-10-10 14:55:54,265 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:54,265 INFO L481 AbstractCegarLoop]: Abstraction has 810 states and 850 transitions.
[2018-10-10 14:55:54,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-10-10 14:55:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 850 transitions.
[2018-10-10 14:55:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2018-10-10 14:55:54,266 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:54,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:54,267 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:54,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:54,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1520257315, now seen corresponding path program 1 times
[2018-10-10 14:55:54,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:54,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:54,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:54,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-10-10 14:55:54,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:55:54,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-10 14:55:54,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-10 14:55:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-10 14:55:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-10 14:55:54,363 INFO L87 Difference]: Start difference. First operand 810 states and 850 transitions. Second operand 3 states.
[2018-10-10 14:55:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:54,502 INFO L93 Difference]: Finished difference Result 829 states and 859 transitions.
[2018-10-10 14:55:54,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-10-10 14:55:54,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162
[2018-10-10 14:55:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:54,506 INFO L225 Difference]: With dead ends: 829
[2018-10-10 14:55:54,506 INFO L226 Difference]: Without dead ends: 829
[2018-10-10 14:55:54,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:55:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states.
[2018-10-10 14:55:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 703.
[2018-10-10 14:55:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states.
[2018-10-10 14:55:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 735 transitions.
[2018-10-10 14:55:54,515 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 735 transitions. Word has length 162
[2018-10-10 14:55:54,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:54,515 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 735 transitions.
[2018-10-10 14:55:54,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-10 14:55:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 735 transitions.
[2018-10-10 14:55:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2018-10-10 14:55:54,517 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:54,517 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:54,517 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:54,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:54,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1757170589, now seen corresponding path program 1 times
[2018-10-10 14:55:54,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:54,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:54,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-10-10 14:55:54,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:55:54,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-10 14:55:54,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-10-10 14:55:54,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-10-10 14:55:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-10-10 14:55:54,778 INFO L87 Difference]: Start difference. First operand 703 states and 735 transitions. Second operand 5 states.
[2018-10-10 14:55:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:55:55,042 INFO L93 Difference]: Finished difference Result 703 states and 728 transitions.
[2018-10-10 14:55:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-10-10 14:55:55,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162
[2018-10-10 14:55:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:55:55,045 INFO L225 Difference]: With dead ends: 703
[2018-10-10 14:55:55,045 INFO L226 Difference]: Without dead ends: 703
[2018-10-10 14:55:55,046 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 14:55:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states.
[2018-10-10 14:55:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 686.
[2018-10-10 14:55:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states.
[2018-10-10 14:55:55,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 712 transitions.
[2018-10-10 14:55:55,052 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 712 transitions. Word has length 162
[2018-10-10 14:55:55,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:55:55,053 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 712 transitions.
[2018-10-10 14:55:55,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-10-10 14:55:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 712 transitions.
[2018-10-10 14:55:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2018-10-10 14:55:55,054 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:55:55,054 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:55:55,054 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:55:55,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:55:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1362286332, now seen corresponding path program 1 times
[2018-10-10 14:55:55,054 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:55:55,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:55:55,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:55,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:55,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:55:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:55,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:55:55,666 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:55:55,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:55:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:55:55,726 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:55:55,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:55:55,809 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 10 treesize of output 9
[2018-10-10 14:55:55,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:55,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:55,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:55:55,825 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 10 treesize of output 9
[2018-10-10 14:55:55,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:55,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:55,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:55,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7
[2018-10-10 14:55:56,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20
[2018-10-10 14:55:56,035 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 20 treesize of output 19
[2018-10-10 14:55:56,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19
[2018-10-10 14:55:56,118 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 23 treesize of output 19
[2018-10-10 14:55:56,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-10-10 14:55:56,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,129 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 19 treesize of output 15
[2018-10-10 14:55:56,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2018-10-10 14:55:56,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7
[2018-10-10 14:55:56,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:55:56,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:55:56,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:55:56,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3
[2018-10-10 14:55:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:55:56,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:55:56,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 41
[2018-10-10 14:55:56,357 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_31.bpl
[2018-10-10 14:55:56,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states
[2018-10-10 14:55:56,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2018-10-10 14:55:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1521, Unknown=0, NotChecked=0, Total=1640
[2018-10-10 14:55:56,359 INFO L87 Difference]: Start difference. First operand 686 states and 712 transitions. Second operand 41 states.
[2018-10-10 14:56:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:00,431 INFO L93 Difference]: Finished difference Result 883 states and 896 transitions.
[2018-10-10 14:56:00,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-10-10 14:56:00,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 163
[2018-10-10 14:56:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:00,434 INFO L225 Difference]: With dead ends: 883
[2018-10-10 14:56:00,435 INFO L226 Difference]: Without dead ends: 883
[2018-10-10 14:56:00,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=930, Invalid=5232, Unknown=0, NotChecked=0, Total=6162
[2018-10-10 14:56:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states.
[2018-10-10 14:56:00,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 601.
[2018-10-10 14:56:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states.
[2018-10-10 14:56:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 616 transitions.
[2018-10-10 14:56:00,445 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 616 transitions. Word has length 163
[2018-10-10 14:56:00,446 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:00,446 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 616 transitions.
[2018-10-10 14:56:00,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states.
[2018-10-10 14:56:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 616 transitions.
[2018-10-10 14:56:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174
[2018-10-10 14:56:00,447 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:00,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:00,448 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:00,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:00,448 INFO L82 PathProgramCache]: Analyzing trace with hash 54153453, now seen corresponding path program 1 times
[2018-10-10 14:56:00,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:00,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:00,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:00,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:00,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2018-10-10 14:56:00,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-10 14:56:00,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-10-10 14:56:00,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-10-10 14:56:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-10-10 14:56:00,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-10-10 14:56:00,918 INFO L87 Difference]: Start difference. First operand 601 states and 616 transitions. Second operand 7 states.
[2018-10-10 14:56:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:01,070 INFO L93 Difference]: Finished difference Result 650 states and 662 transitions.
[2018-10-10 14:56:01,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-10-10 14:56:01,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173
[2018-10-10 14:56:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:01,073 INFO L225 Difference]: With dead ends: 650
[2018-10-10 14:56:01,073 INFO L226 Difference]: Without dead ends: 650
[2018-10-10 14:56:01,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182
[2018-10-10 14:56:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states.
[2018-10-10 14:56:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 610.
[2018-10-10 14:56:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states.
[2018-10-10 14:56:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 625 transitions.
[2018-10-10 14:56:01,080 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 625 transitions. Word has length 173
[2018-10-10 14:56:01,080 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:01,080 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 625 transitions.
[2018-10-10 14:56:01,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-10-10 14:56:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 625 transitions.
[2018-10-10 14:56:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2018-10-10 14:56:01,081 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:01,082 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:01,082 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:01,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1678757355, now seen corresponding path program 1 times
[2018-10-10 14:56:01,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:01,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:01,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-10-10 14:56:01,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:56:01,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:56:01,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:01,842 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:56:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-10-10 14:56:01,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:56:01,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7
[2018-10-10 14:56:01,992 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_33.bpl
[2018-10-10 14:56:01,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-10 14:56:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-10 14:56:01,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-10-10 14:56:01,994 INFO L87 Difference]: Start difference. First operand 610 states and 625 transitions. Second operand 8 states.
[2018-10-10 14:56:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:02,583 INFO L93 Difference]: Finished difference Result 722 states and 734 transitions.
[2018-10-10 14:56:02,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-10-10 14:56:02,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174
[2018-10-10 14:56:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:02,587 INFO L225 Difference]: With dead ends: 722
[2018-10-10 14:56:02,587 INFO L226 Difference]: Without dead ends: 722
[2018-10-10 14:56:02,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2018-10-10 14:56:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states.
[2018-10-10 14:56:02,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 626.
[2018-10-10 14:56:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states.
[2018-10-10 14:56:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 641 transitions.
[2018-10-10 14:56:02,593 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 641 transitions. Word has length 174
[2018-10-10 14:56:02,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:02,594 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 641 transitions.
[2018-10-10 14:56:02,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-10 14:56:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 641 transitions.
[2018-10-10 14:56:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2018-10-10 14:56:02,595 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:02,595 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:02,595 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:02,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:02,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1115363898, now seen corresponding path program 1 times
[2018-10-10 14:56:02,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:02,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:02,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:02,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:02,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:03,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:56:03,040 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:56:03,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:03,107 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:56:03,234 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:03,234 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:03,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:56:03,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:03,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:03,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13
[2018-10-10 14:56:03,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-10-10 14:56:03,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:03,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:03,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9
[2018-10-10 14:56:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:03,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:56:03,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 22
[2018-10-10 14:56:03,441 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_34.bpl
[2018-10-10 14:56:03,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-10-10 14:56:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-10-10 14:56:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506
[2018-10-10 14:56:03,443 INFO L87 Difference]: Start difference. First operand 626 states and 641 transitions. Second operand 23 states.
[2018-10-10 14:56:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:07,097 INFO L93 Difference]: Finished difference Result 1094 states and 1112 transitions.
[2018-10-10 14:56:07,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-10-10 14:56:07,097 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 176
[2018-10-10 14:56:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:07,101 INFO L225 Difference]: With dead ends: 1094
[2018-10-10 14:56:07,101 INFO L226 Difference]: Without dead ends: 1094
[2018-10-10 14:56:07,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 171 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=794, Invalid=3238, Unknown=0, NotChecked=0, Total=4032
[2018-10-10 14:56:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states.
[2018-10-10 14:56:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 638.
[2018-10-10 14:56:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states.
[2018-10-10 14:56:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 653 transitions.
[2018-10-10 14:56:07,110 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 653 transitions. Word has length 176
[2018-10-10 14:56:07,110 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:07,110 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 653 transitions.
[2018-10-10 14:56:07,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-10-10 14:56:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 653 transitions.
[2018-10-10 14:56:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2018-10-10 14:56:07,111 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:07,112 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:07,112 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:07,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1318176421, now seen corresponding path program 1 times
[2018-10-10 14:56:07,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:07,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:08,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:56:08,482 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:56:08,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:08,548 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:56:08,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:56:08,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:08,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:08,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:56:09,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-10-10 14:56:09,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-10-10 14:56:09,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19
[2018-10-10 14:56:09,252 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:09,253 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:09,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:56:09,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18
[2018-10-10 14:56:09,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:56:09,534 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 10 treesize of output 9
[2018-10-10 14:56:09,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29
[2018-10-10 14:56:09,664 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 20 treesize of output 16
[2018-10-10 14:56:09,666 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 16 treesize of output 4
[2018-10-10 14:56:09,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17
[2018-10-10 14:56:09,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20
[2018-10-10 14:56:09,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-10-10 14:56:09,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17
[2018-10-10 14:56:09,975 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:09,976 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:09,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:56:09,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:09,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16
[2018-10-10 14:56:10,259 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 13 treesize of output 10
[2018-10-10 14:56:10,271 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 10 treesize of output 9
[2018-10-10 14:56:10,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22
[2018-10-10 14:56:10,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12
[2018-10-10 14:56:10,392 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 12 treesize of output 4
[2018-10-10 14:56:10,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12
[2018-10-10 14:56:10,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20
[2018-10-10 14:56:10,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-10-10 14:56:10,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7
[2018-10-10 14:56:10,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:56:10,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-10-10 14:56:10,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:10,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3
[2018-10-10 14:56:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:10,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:56:10,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 74
[2018-10-10 14:56:10,998 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_35.bpl
[2018-10-10 14:56:10,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states
[2018-10-10 14:56:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants.
[2018-10-10 14:56:11,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=5055, Unknown=0, NotChecked=0, Total=5402
[2018-10-10 14:56:11,000 INFO L87 Difference]: Start difference. First operand 638 states and 653 transitions. Second operand 74 states.
[2018-10-10 14:56:12,524 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40
[2018-10-10 14:56:12,743 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 45
[2018-10-10 14:56:13,010 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 56
[2018-10-10 14:56:13,359 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 65
[2018-10-10 14:56:13,651 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 71
[2018-10-10 14:56:14,032 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 76
[2018-10-10 14:56:14,387 WARN L178 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 81
[2018-10-10 14:56:14,963 WARN L178 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60
[2018-10-10 14:56:15,307 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68
[2018-10-10 14:56:17,835 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 58
[2018-10-10 14:56:18,295 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 63
[2018-10-10 14:56:18,596 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 71
[2018-10-10 14:56:18,991 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 74
[2018-10-10 14:56:19,299 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77
[2018-10-10 14:56:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:22,994 INFO L93 Difference]: Finished difference Result 685 states and 695 transitions.
[2018-10-10 14:56:22,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2018-10-10 14:56:22,994 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182
[2018-10-10 14:56:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:22,998 INFO L225 Difference]: With dead ends: 685
[2018-10-10 14:56:22,998 INFO L226 Difference]: Without dead ends: 685
[2018-10-10 14:56:23,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6200 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2560, Invalid=19492, Unknown=0, NotChecked=0, Total=22052
[2018-10-10 14:56:23,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states.
[2018-10-10 14:56:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 617.
[2018-10-10 14:56:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states.
[2018-10-10 14:56:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 629 transitions.
[2018-10-10 14:56:23,006 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 629 transitions. Word has length 182
[2018-10-10 14:56:23,006 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:23,006 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 629 transitions.
[2018-10-10 14:56:23,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states.
[2018-10-10 14:56:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 629 transitions.
[2018-10-10 14:56:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2018-10-10 14:56:23,007 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:23,008 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:23,008 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:23,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2058082254, now seen corresponding path program 1 times
[2018-10-10 14:56:23,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:23,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:23,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:56:23,884 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:56:23,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:23,954 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:56:23,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:56:23,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:23,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:23,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:56:24,175 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:24,176 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:24,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-10-10 14:56:24,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21
[2018-10-10 14:56:24,376 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 13 treesize of output 10
[2018-10-10 14:56:24,377 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 10 treesize of output 9
[2018-10-10 14:56:24,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27
[2018-10-10 14:56:24,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-10-10 14:56:24,626 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 14:56:24,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15
[2018-10-10 14:56:24,840 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:24,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15
[2018-10-10 14:56:24,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:24,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:56:24,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11
[2018-10-10 14:56:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-10-10 14:56:25,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:56:25,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22] total 50
[2018-10-10 14:56:25,086 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_36.bpl
[2018-10-10 14:56:25,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states
[2018-10-10 14:56:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2018-10-10 14:56:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2411, Unknown=0, NotChecked=0, Total=2550
[2018-10-10 14:56:25,088 INFO L87 Difference]: Start difference. First operand 617 states and 629 transitions. Second operand 51 states.
[2018-10-10 14:56:26,585 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55
[2018-10-10 14:56:26,793 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59
[2018-10-10 14:56:27,064 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62
[2018-10-10 14:56:27,290 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64
[2018-10-10 14:56:28,090 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49
[2018-10-10 14:56:28,281 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52
[2018-10-10 14:56:29,237 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50
[2018-10-10 14:56:30,010 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 55
[2018-10-10 14:56:30,298 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 53
[2018-10-10 14:56:30,525 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 60
[2018-10-10 14:56:30,689 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57
[2018-10-10 14:56:31,015 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57
[2018-10-10 14:56:31,202 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62
[2018-10-10 14:56:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:33,052 INFO L93 Difference]: Finished difference Result 735 states and 747 transitions.
[2018-10-10 14:56:33,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2018-10-10 14:56:33,052 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 184
[2018-10-10 14:56:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:33,055 INFO L225 Difference]: With dead ends: 735
[2018-10-10 14:56:33,055 INFO L226 Difference]: Without dead ends: 735
[2018-10-10 14:56:33,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1011, Invalid=8495, Unknown=0, NotChecked=0, Total=9506
[2018-10-10 14:56:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states.
[2018-10-10 14:56:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 627.
[2018-10-10 14:56:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states.
[2018-10-10 14:56:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 639 transitions.
[2018-10-10 14:56:33,063 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 639 transitions. Word has length 184
[2018-10-10 14:56:33,063 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:33,063 INFO L481 AbstractCegarLoop]: Abstraction has 627 states and 639 transitions.
[2018-10-10 14:56:33,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states.
[2018-10-10 14:56:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 639 transitions.
[2018-10-10 14:56:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186
[2018-10-10 14:56:33,064 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:33,064 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:33,064 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:33,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash 623959846, now seen corresponding path program 1 times
[2018-10-10 14:56:33,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:33,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:33,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:33,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:34,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:56:34,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:56:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:34,256 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:56:35,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:56:35,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:35,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:35,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15
[2018-10-10 14:56:36,463 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 17
[2018-10-10 14:56:36,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:56:36,518 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 10 treesize of output 9
[2018-10-10 14:56:36,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:36,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:36,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:56:36,694 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 10 treesize of output 9
[2018-10-10 14:56:36,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:36,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:36,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:36,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21
[2018-10-10 14:56:37,289 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 17 treesize of output 13
[2018-10-10 14:56:37,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5
[2018-10-10 14:56:37,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:37,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:37,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:56:37,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:56:37,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:37,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:37,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:37,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9
[2018-10-10 14:56:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-10-10 14:56:37,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:56:37,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 15] total 38
[2018-10-10 14:56:37,500 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl
[2018-10-10 14:56:37,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-10-10 14:56:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-10-10 14:56:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1378, Unknown=0, NotChecked=0, Total=1482
[2018-10-10 14:56:37,501 INFO L87 Difference]: Start difference. First operand 627 states and 639 transitions. Second operand 39 states.
[2018-10-10 14:56:38,945 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50
[2018-10-10 14:56:39,210 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67
[2018-10-10 14:56:39,461 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69
[2018-10-10 14:56:39,810 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83
[2018-10-10 14:56:40,172 WARN L178 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 103
[2018-10-10 14:56:40,525 WARN L178 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99
[2018-10-10 14:56:40,919 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 104
[2018-10-10 14:56:41,084 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62
[2018-10-10 14:56:41,555 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69
[2018-10-10 14:56:42,220 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61
[2018-10-10 14:56:43,196 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66
[2018-10-10 14:56:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:44,854 INFO L93 Difference]: Finished difference Result 772 states and 782 transitions.
[2018-10-10 14:56:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2018-10-10 14:56:44,854 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 185
[2018-10-10 14:56:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:44,858 INFO L225 Difference]: With dead ends: 772
[2018-10-10 14:56:44,858 INFO L226 Difference]: Without dead ends: 772
[2018-10-10 14:56:44,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=835, Invalid=4715, Unknown=0, NotChecked=0, Total=5550
[2018-10-10 14:56:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states.
[2018-10-10 14:56:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 635.
[2018-10-10 14:56:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states.
[2018-10-10 14:56:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 648 transitions.
[2018-10-10 14:56:44,867 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 648 transitions. Word has length 185
[2018-10-10 14:56:44,867 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:44,867 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 648 transitions.
[2018-10-10 14:56:44,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-10-10 14:56:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 648 transitions.
[2018-10-10 14:56:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189
[2018-10-10 14:56:44,868 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:44,868 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:44,869 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:44,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash -578774942, now seen corresponding path program 1 times
[2018-10-10 14:56:44,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:44,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:44,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:44,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:44,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:46,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:56:46,194 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:56:46,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:46,266 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:56:46,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:56:46,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:56:46,497 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:46,498 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:46,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:56:46,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:56:46,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:56:46,636 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 10 treesize of output 9
[2018-10-10 14:56:46,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17
[2018-10-10 14:56:46,957 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 45 treesize of output 39
[2018-10-10 14:56:46,959 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 14 treesize of output 13
[2018-10-10 14:56:46,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:46,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:22
[2018-10-10 14:56:47,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-10-10 14:56:47,095 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 14:56:47,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:47,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:47,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:47,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5
[2018-10-10 14:56:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:47,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:56:47,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 46
[2018-10-10 14:56:47,243 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_38.bpl
[2018-10-10 14:56:47,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states
[2018-10-10 14:56:47,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2018-10-10 14:56:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=2047, Unknown=0, NotChecked=0, Total=2162
[2018-10-10 14:56:47,245 INFO L87 Difference]: Start difference. First operand 635 states and 648 transitions. Second operand 47 states.
[2018-10-10 14:56:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:56:55,955 INFO L93 Difference]: Finished difference Result 1017 states and 1035 transitions.
[2018-10-10 14:56:55,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states.
[2018-10-10 14:56:55,956 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 188
[2018-10-10 14:56:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:56:55,961 INFO L225 Difference]: With dead ends: 1017
[2018-10-10 14:56:55,961 INFO L226 Difference]: Without dead ends: 1017
[2018-10-10 14:56:55,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1347, Invalid=10643, Unknown=0, NotChecked=0, Total=11990
[2018-10-10 14:56:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states.
[2018-10-10 14:56:55,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 691.
[2018-10-10 14:56:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states.
[2018-10-10 14:56:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 704 transitions.
[2018-10-10 14:56:55,968 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 704 transitions. Word has length 188
[2018-10-10 14:56:55,968 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:56:55,968 INFO L481 AbstractCegarLoop]: Abstraction has 691 states and 704 transitions.
[2018-10-10 14:56:55,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states.
[2018-10-10 14:56:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 704 transitions.
[2018-10-10 14:56:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190
[2018-10-10 14:56:55,969 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:56:55,970 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:56:55,970 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:56:55,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:56:55,970 INFO L82 PathProgramCache]: Analyzing trace with hash -762153826, now seen corresponding path program 1 times
[2018-10-10 14:56:55,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:56:55,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:56:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:55,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:55,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:56:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:57,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:56:57,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:56:57,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:56:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:56:57,166 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:56:57,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:56:57,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:56:57,372 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:57,372 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:56:57,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:56:57,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:56:57,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:56:57,582 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 10 treesize of output 9
[2018-10-10 14:56:57,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:56:57,600 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 10 treesize of output 9
[2018-10-10 14:56:57,600 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:57,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26
[2018-10-10 14:56:58,236 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 70 treesize of output 64
[2018-10-10 14:56:58,239 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 14 treesize of output 13
[2018-10-10 14:56:58,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34
[2018-10-10 14:56:58,272 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 14 treesize of output 13
[2018-10-10 14:56:58,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:82, output treesize:31
[2018-10-10 14:56:58,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-10-10 14:56:58,467 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 14:56:58,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:56:58,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:56:58,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:56:58,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9
[2018-10-10 14:56:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:56:58,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:56:58,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 59
[2018-10-10 14:56:58,888 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_39.bpl
[2018-10-10 14:56:58,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states
[2018-10-10 14:56:58,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants.
[2018-10-10 14:56:58,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3386, Unknown=0, NotChecked=0, Total=3540
[2018-10-10 14:56:58,890 INFO L87 Difference]: Start difference. First operand 691 states and 704 transitions. Second operand 60 states.
[2018-10-10 14:57:00,717 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62
[2018-10-10 14:57:00,985 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66
[2018-10-10 14:57:01,182 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68
[2018-10-10 14:57:03,651 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54
[2018-10-10 14:57:03,943 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58
[2018-10-10 14:57:04,525 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54
[2018-10-10 14:57:05,769 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59
[2018-10-10 14:57:05,929 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67
[2018-10-10 14:57:07,556 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57
[2018-10-10 14:57:07,797 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59
[2018-10-10 14:57:08,213 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65
[2018-10-10 14:57:08,463 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70
[2018-10-10 14:57:08,695 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70
[2018-10-10 14:57:08,884 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65
[2018-10-10 14:57:09,180 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72
[2018-10-10 14:57:09,690 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72
[2018-10-10 14:57:09,949 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83
[2018-10-10 14:57:10,553 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67
[2018-10-10 14:57:10,961 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56
[2018-10-10 14:57:11,192 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62
[2018-10-10 14:57:11,641 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60
[2018-10-10 14:57:12,534 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64
[2018-10-10 14:57:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:57:13,709 INFO L93 Difference]: Finished difference Result 1021 states and 1037 transitions.
[2018-10-10 14:57:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2018-10-10 14:57:13,709 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 189
[2018-10-10 14:57:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:57:13,712 INFO L225 Difference]: With dead ends: 1021
[2018-10-10 14:57:13,712 INFO L226 Difference]: Without dead ends: 1021
[2018-10-10 14:57:13,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3888 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1734, Invalid=15558, Unknown=0, NotChecked=0, Total=17292
[2018-10-10 14:57:13,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states.
[2018-10-10 14:57:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 706.
[2018-10-10 14:57:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states.
[2018-10-10 14:57:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 720 transitions.
[2018-10-10 14:57:13,719 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 720 transitions. Word has length 189
[2018-10-10 14:57:13,719 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:57:13,719 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 720 transitions.
[2018-10-10 14:57:13,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states.
[2018-10-10 14:57:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 720 transitions.
[2018-10-10 14:57:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199
[2018-10-10 14:57:13,720 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:57:13,721 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:57:13,721 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:57:13,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:57:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash -583293953, now seen corresponding path program 1 times
[2018-10-10 14:57:13,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:57:13,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:57:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:57:13,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:57:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:57:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:57:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-10-10 14:57:14,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:57:14,294 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:57:14,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:57:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:57:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:57:14,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:57:14,443 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 10 treesize of output 9
[2018-10-10 14:57:14,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:57:14,458 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 10 treesize of output 9
[2018-10-10 14:57:14,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,469 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7
[2018-10-10 14:57:14,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20
[2018-10-10 14:57:14,594 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 20 treesize of output 19
[2018-10-10 14:57:14,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19
[2018-10-10 14:57:14,651 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 23 treesize of output 19
[2018-10-10 14:57:14,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-10-10 14:57:14,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,672 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 19 treesize of output 15
[2018-10-10 14:57:14,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2018-10-10 14:57:14,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7
[2018-10-10 14:57:14,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:57:14,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:57:14,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:14,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3
[2018-10-10 14:57:14,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-10-10 14:57:14,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:57:14,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 30
[2018-10-10 14:57:14,860 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_40.bpl
[2018-10-10 14:57:14,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states
[2018-10-10 14:57:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2018-10-10 14:57:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870
[2018-10-10 14:57:14,861 INFO L87 Difference]: Start difference. First operand 706 states and 720 transitions. Second operand 30 states.
[2018-10-10 14:57:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:57:17,550 INFO L93 Difference]: Finished difference Result 876 states and 887 transitions.
[2018-10-10 14:57:17,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-10-10 14:57:17,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 198
[2018-10-10 14:57:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:57:17,554 INFO L225 Difference]: With dead ends: 876
[2018-10-10 14:57:17,554 INFO L226 Difference]: Without dead ends: 876
[2018-10-10 14:57:17,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=668, Invalid=3114, Unknown=0, NotChecked=0, Total=3782
[2018-10-10 14:57:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states.
[2018-10-10 14:57:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 706.
[2018-10-10 14:57:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states.
[2018-10-10 14:57:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 719 transitions.
[2018-10-10 14:57:17,561 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 719 transitions. Word has length 198
[2018-10-10 14:57:17,561 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:57:17,561 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 719 transitions.
[2018-10-10 14:57:17,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states.
[2018-10-10 14:57:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 719 transitions.
[2018-10-10 14:57:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2018-10-10 14:57:17,562 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:57:17,562 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:57:17,562 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:57:17,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:57:17,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1405046059, now seen corresponding path program 1 times
[2018-10-10 14:57:17,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:57:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:57:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:57:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:57:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:57:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:57:18,248 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10
[2018-10-10 14:57:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:57:19,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:57:19,845 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:57:19,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:57:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:57:19,917 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:57:20,289 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:57:20,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25
[2018-10-10 14:57:20,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:31
[2018-10-10 14:57:20,541 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 13 treesize of output 10
[2018-10-10 14:57:20,543 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 10 treesize of output 9
[2018-10-10 14:57:20,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:43
[2018-10-10 14:57:20,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26
[2018-10-10 14:57:20,839 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 26 treesize of output 15
[2018-10-10 14:57:20,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:20,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:25
[2018-10-10 14:57:21,301 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:57:21,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15
[2018-10-10 14:57:21,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:21,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:57:21,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21
[2018-10-10 14:57:21,586 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:57:21,587 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:57:21,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-10-10 14:57:21,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:21,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:57:21,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25
[2018-10-10 14:57:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2018-10-10 14:57:21,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:57:21,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 55
[2018-10-10 14:57:21,902 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_41.bpl
[2018-10-10 14:57:21,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states
[2018-10-10 14:57:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants.
[2018-10-10 14:57:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2942, Unknown=4, NotChecked=0, Total=3080
[2018-10-10 14:57:21,904 INFO L87 Difference]: Start difference. First operand 706 states and 719 transitions. Second operand 56 states.
[2018-10-10 14:57:25,395 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 44
[2018-10-10 14:57:25,946 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 55
[2018-10-10 14:57:26,274 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 60
[2018-10-10 14:57:26,778 WARN L178 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 62
[2018-10-10 14:57:27,127 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 64
[2018-10-10 14:57:28,059 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 45
[2018-10-10 14:57:29,633 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 48
[2018-10-10 14:57:30,074 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46
[2018-10-10 14:57:30,860 WARN L178 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 57
[2018-10-10 14:57:31,107 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 46
[2018-10-10 14:57:31,285 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42
[2018-10-10 14:57:31,568 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50
[2018-10-10 14:57:31,828 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 53
[2018-10-10 14:57:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:57:33,374 INFO L93 Difference]: Finished difference Result 762 states and 772 transitions.
[2018-10-10 14:57:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2018-10-10 14:57:33,374 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 203
[2018-10-10 14:57:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:57:33,377 INFO L225 Difference]: With dead ends: 762
[2018-10-10 14:57:33,377 INFO L226 Difference]: Without dead ends: 639
[2018-10-10 14:57:33,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=669, Invalid=7699, Unknown=4, NotChecked=0, Total=8372
[2018-10-10 14:57:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states.
[2018-10-10 14:57:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 594.
[2018-10-10 14:57:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states.
[2018-10-10 14:57:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 606 transitions.
[2018-10-10 14:57:33,384 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 606 transitions. Word has length 203
[2018-10-10 14:57:33,384 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:57:33,384 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 606 transitions.
[2018-10-10 14:57:33,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states.
[2018-10-10 14:57:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 606 transitions.
[2018-10-10 14:57:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2018-10-10 14:57:33,385 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:57:33,386 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:57:33,386 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:57:33,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:57:33,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2072301677, now seen corresponding path program 1 times
[2018-10-10 14:57:33,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:57:33,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:57:33,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:57:33,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:57:33,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:57:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:57:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:57:37,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:57:37,166 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:57:37,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:57:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:57:37,244 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:57:37,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:57:37,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:57:37,500 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:57:37,501 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:57:37,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:57:37,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:57:37,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:57:37,792 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 10 treesize of output 9
[2018-10-10 14:57:37,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:57:37,811 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 10 treesize of output 9
[2018-10-10 14:57:37,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:37,825 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:26
[2018-10-10 14:57:38,536 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 70 treesize of output 64
[2018-10-10 14:57:38,539 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 14 treesize of output 13
[2018-10-10 14:57:38,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34
[2018-10-10 14:57:38,571 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 14 treesize of output 13
[2018-10-10 14:57:38,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:82, output treesize:31
[2018-10-10 14:57:38,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-10-10 14:57:38,825 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 14:57:38,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:57:38,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2018-10-10 14:57:38,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:57:38,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9
[2018-10-10 14:57:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:57:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:57:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 30] total 74
[2018-10-10 14:57:39,422 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_42.bpl
[2018-10-10 14:57:39,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states
[2018-10-10 14:57:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants.
[2018-10-10 14:57:39,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=5320, Unknown=0, NotChecked=0, Total=5550
[2018-10-10 14:57:39,423 INFO L87 Difference]: Start difference. First operand 594 states and 606 transitions. Second operand 75 states.
[2018-10-10 14:57:40,806 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57
[2018-10-10 14:57:41,855 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56
[2018-10-10 14:57:42,248 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73
[2018-10-10 14:57:42,867 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 88
[2018-10-10 14:57:43,425 WARN L178 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 100
[2018-10-10 14:57:44,098 WARN L178 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 105
[2018-10-10 14:57:44,684 WARN L178 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 107
[2018-10-10 14:57:44,937 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60
[2018-10-10 14:57:45,230 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58
[2018-10-10 14:57:45,582 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65
[2018-10-10 14:57:45,894 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 62
[2018-10-10 14:57:46,333 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74
[2018-10-10 14:57:46,601 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66
[2018-10-10 14:57:47,167 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56
[2018-10-10 14:57:47,352 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58
[2018-10-10 14:57:47,680 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69
[2018-10-10 14:57:47,992 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78
[2018-10-10 14:57:48,325 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85
[2018-10-10 14:57:48,733 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93
[2018-10-10 14:57:49,304 WARN L178 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99
[2018-10-10 14:57:49,739 WARN L178 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 101
[2018-10-10 14:57:50,186 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 100
[2018-10-10 14:57:50,456 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59
[2018-10-10 14:57:50,737 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67
[2018-10-10 14:57:51,901 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59
[2018-10-10 14:57:53,196 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63
[2018-10-10 14:57:53,523 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 67
[2018-10-10 14:57:53,894 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73
[2018-10-10 14:57:54,212 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 78
[2018-10-10 14:57:54,505 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 78
[2018-10-10 14:57:54,746 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73
[2018-10-10 14:57:55,059 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77
[2018-10-10 14:57:55,658 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 88
[2018-10-10 14:57:56,385 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74
[2018-10-10 14:57:56,712 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 69
[2018-10-10 14:57:57,165 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 66
[2018-10-10 14:57:57,491 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70
[2018-10-10 14:57:57,798 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61
[2018-10-10 14:57:58,027 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67
[2018-10-10 14:57:58,953 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66
[2018-10-10 14:57:59,586 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59
[2018-10-10 14:58:00,601 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59
[2018-10-10 14:58:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:58:01,331 INFO L93 Difference]: Finished difference Result 943 states and 961 transitions.
[2018-10-10 14:58:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states.
[2018-10-10 14:58:01,331 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 215
[2018-10-10 14:58:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:58:01,336 INFO L225 Difference]: With dead ends: 943
[2018-10-10 14:58:01,336 INFO L226 Difference]: Without dead ends: 943
[2018-10-10 14:58:01,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 189 SyntacticMatches, 8 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4282 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=2086, Invalid=17654, Unknown=0, NotChecked=0, Total=19740
[2018-10-10 14:58:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states.
[2018-10-10 14:58:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 606.
[2018-10-10 14:58:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states.
[2018-10-10 14:58:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 618 transitions.
[2018-10-10 14:58:01,345 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 618 transitions. Word has length 215
[2018-10-10 14:58:01,345 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:58:01,345 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 618 transitions.
[2018-10-10 14:58:01,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states.
[2018-10-10 14:58:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 618 transitions.
[2018-10-10 14:58:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222
[2018-10-10 14:58:01,347 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:58:01,347 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:58:01,347 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:58:01,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:58:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2021705896, now seen corresponding path program 1 times
[2018-10-10 14:58:01,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:58:01,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:58:01,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:01,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:01,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2018-10-10 14:58:02,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:58:02,468 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:58:02,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:02,539 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:58:02,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:58:02,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:58:02,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:02,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:02,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:02,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3
[2018-10-10 14:58:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2018-10-10 14:58:02,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:58:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17
[2018-10-10 14:58:02,704 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_43.bpl
[2018-10-10 14:58:02,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-10-10 14:58:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-10-10 14:58:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2018-10-10 14:58:02,705 INFO L87 Difference]: Start difference. First operand 606 states and 618 transitions. Second operand 17 states.
[2018-10-10 14:58:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:58:03,585 INFO L93 Difference]: Finished difference Result 662 states and 672 transitions.
[2018-10-10 14:58:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-10-10 14:58:03,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 221
[2018-10-10 14:58:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:58:03,589 INFO L225 Difference]: With dead ends: 662
[2018-10-10 14:58:03,589 INFO L226 Difference]: Without dead ends: 662
[2018-10-10 14:58:03,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056
[2018-10-10 14:58:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states.
[2018-10-10 14:58:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 604.
[2018-10-10 14:58:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states.
[2018-10-10 14:58:03,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 615 transitions.
[2018-10-10 14:58:03,596 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 615 transitions. Word has length 221
[2018-10-10 14:58:03,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:58:03,596 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 615 transitions.
[2018-10-10 14:58:03,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-10-10 14:58:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 615 transitions.
[2018-10-10 14:58:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2018-10-10 14:58:03,597 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:58:03,598 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:58:03,598 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:58:03,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:58:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1505139426, now seen corresponding path program 1 times
[2018-10-10 14:58:03,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:58:03,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:58:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:03,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:03,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2018-10-10 14:58:03,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:58:03,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:58:03,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:03,959 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:58:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2018-10-10 14:58:04,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:58:04,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7
[2018-10-10 14:58:04,100 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_44.bpl
[2018-10-10 14:58:04,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-10-10 14:58:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-10-10 14:58:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-10-10 14:58:04,101 INFO L87 Difference]: Start difference. First operand 604 states and 615 transitions. Second operand 8 states.
[2018-10-10 14:58:04,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:58:04,562 INFO L93 Difference]: Finished difference Result 647 states and 657 transitions.
[2018-10-10 14:58:04,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-10-10 14:58:04,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 226
[2018-10-10 14:58:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:58:04,567 INFO L225 Difference]: With dead ends: 647
[2018-10-10 14:58:04,567 INFO L226 Difference]: Without dead ends: 647
[2018-10-10 14:58:04,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156
[2018-10-10 14:58:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states.
[2018-10-10 14:58:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 605.
[2018-10-10 14:58:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states.
[2018-10-10 14:58:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 616 transitions.
[2018-10-10 14:58:04,573 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 616 transitions. Word has length 226
[2018-10-10 14:58:04,573 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:58:04,573 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 616 transitions.
[2018-10-10 14:58:04,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-10-10 14:58:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 616 transitions.
[2018-10-10 14:58:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2018-10-10 14:58:04,575 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:58:04,575 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:58:04,575 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:58:04,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:58:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2076416533, now seen corresponding path program 1 times
[2018-10-10 14:58:04,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:58:04,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:58:04,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:04,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:58:06,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:58:06,089 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:58:06,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:06,170 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:58:06,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:58:06,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:58:06,373 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:58:06,374 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:58:06,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:58:06,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:58:06,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:58:06,606 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 10 treesize of output 9
[2018-10-10 14:58:06,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:58:06,626 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 10 treesize of output 9
[2018-10-10 14:58:06,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:06,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:26
[2018-10-10 14:58:07,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:58:07,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:07,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:07,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46
[2018-10-10 14:58:07,367 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 57 treesize of output 51
[2018-10-10 14:58:07,370 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 14 treesize of output 13
[2018-10-10 14:58:07,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:07,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:07,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45
[2018-10-10 14:58:07,402 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 14 treesize of output 13
[2018-10-10 14:58:07,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:07,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:07,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:58:07,427 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:49
[2018-10-10 14:58:08,085 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 24 treesize of output 18
[2018-10-10 14:58:08,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-10-10 14:58:08,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:08,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:08,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:58:08,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:40
[2018-10-10 14:58:08,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24
[2018-10-10 14:58:08,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4
[2018-10-10 14:58:08,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:08,461 INFO L682 Elim1Store]: detected equality via solver
[2018-10-10 14:58:08,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2018-10-10 14:58:08,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:08,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:08,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:08,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:5
[2018-10-10 14:58:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:58:08,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:58:08,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 65
[2018-10-10 14:58:08,811 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_45.bpl
[2018-10-10 14:58:08,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states
[2018-10-10 14:58:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants.
[2018-10-10 14:58:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=4099, Unknown=0, NotChecked=0, Total=4290
[2018-10-10 14:58:08,813 INFO L87 Difference]: Start difference. First operand 605 states and 616 transitions. Second operand 66 states.
[2018-10-10 14:58:10,557 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58
[2018-10-10 14:58:10,832 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64
[2018-10-10 14:58:11,035 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68
[2018-10-10 14:58:13,118 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59
[2018-10-10 14:58:13,532 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75
[2018-10-10 14:58:13,773 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90
[2018-10-10 14:58:14,100 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87
[2018-10-10 14:58:14,901 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77
[2018-10-10 14:58:15,085 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84
[2018-10-10 14:58:15,535 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 80
[2018-10-10 14:58:16,086 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67
[2018-10-10 14:58:16,306 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 69
[2018-10-10 14:58:16,567 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 66
[2018-10-10 14:58:16,931 WARN L178 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 72
[2018-10-10 14:58:17,199 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 80
[2018-10-10 14:58:17,473 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79
[2018-10-10 14:58:17,789 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 71
[2018-10-10 14:58:18,104 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 70
[2018-10-10 14:58:18,361 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73
[2018-10-10 14:58:18,819 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86
[2018-10-10 14:58:19,602 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98
[2018-10-10 14:58:20,106 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88
[2018-10-10 14:58:20,340 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91
[2018-10-10 14:58:20,612 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94
[2018-10-10 14:58:20,880 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79
[2018-10-10 14:58:21,091 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63
[2018-10-10 14:58:22,108 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 82
[2018-10-10 14:58:22,331 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 91
[2018-10-10 14:58:23,300 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74
[2018-10-10 14:58:23,803 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71
[2018-10-10 14:58:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:58:24,953 INFO L93 Difference]: Finished difference Result 862 states and 877 transitions.
[2018-10-10 14:58:24,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states.
[2018-10-10 14:58:24,957 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 227
[2018-10-10 14:58:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:58:24,958 INFO L225 Difference]: With dead ends: 862
[2018-10-10 14:58:24,959 INFO L226 Difference]: Without dead ends: 862
[2018-10-10 14:58:24,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 200 SyntacticMatches, 5 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4475 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1692, Invalid=16940, Unknown=0, NotChecked=0, Total=18632
[2018-10-10 14:58:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states.
[2018-10-10 14:58:24,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 617.
[2018-10-10 14:58:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states.
[2018-10-10 14:58:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 628 transitions.
[2018-10-10 14:58:24,964 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 628 transitions. Word has length 227
[2018-10-10 14:58:24,965 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:58:24,965 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 628 transitions.
[2018-10-10 14:58:24,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states.
[2018-10-10 14:58:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 628 transitions.
[2018-10-10 14:58:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2018-10-10 14:58:24,966 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:58:24,967 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:58:24,967 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:58:24,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:58:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -55596725, now seen corresponding path program 1 times
[2018-10-10 14:58:24,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:58:24,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:58:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:58:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:58:26,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:58:26,728 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:58:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:58:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:58:26,810 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:58:26,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:58:26,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:26,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:26,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:58:27,004 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:58:27,005 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:58:27,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:58:27,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:58:27,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:58:27,263 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 10 treesize of output 9
[2018-10-10 14:58:27,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:58:27,283 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 10 treesize of output 9
[2018-10-10 14:58:27,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:26
[2018-10-10 14:58:27,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:58:27,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:27,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46
[2018-10-10 14:58:28,097 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:58:28,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34
[2018-10-10 14:58:28,104 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 10 treesize of output 9
[2018-10-10 14:58:28,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:28,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:28,131 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:58:28,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39
[2018-10-10 14:58:28,145 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 16 treesize of output 15
[2018-10-10 14:58:28,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:28,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:28,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:28,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:64
[2018-10-10 14:58:29,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69
[2018-10-10 14:58:29,736 INFO L682 Elim1Store]: detected equality via solver
[2018-10-10 14:58:29,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-10-10 14:58:29,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:29,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38
[2018-10-10 14:58:29,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:58:29,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:58:29,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40
[2018-10-10 14:58:29,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23
[2018-10-10 14:58:29,920 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:58:29,931 INFO L682 Elim1Store]: detected equality via solver
[2018-10-10 14:58:29,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12
[2018-10-10 14:58:29,932 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:29,941 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:29,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:58:29,952 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:103, output treesize:12
[2018-10-10 14:58:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:58:30,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:58:30,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 42] total 76
[2018-10-10 14:58:30,406 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_46.bpl
[2018-10-10 14:58:30,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states
[2018-10-10 14:58:30,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants.
[2018-10-10 14:58:30,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=5631, Unknown=12, NotChecked=0, Total=5852
[2018-10-10 14:58:30,408 INFO L87 Difference]: Start difference. First operand 617 states and 628 transitions. Second operand 77 states.
[2018-10-10 14:58:32,750 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58
[2018-10-10 14:58:33,120 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64
[2018-10-10 14:58:33,350 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68
[2018-10-10 14:58:38,150 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60
[2018-10-10 14:58:38,417 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72
[2018-10-10 14:58:39,055 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 75
[2018-10-10 14:58:39,388 WARN L178 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 79
[2018-10-10 14:58:39,908 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 84
[2018-10-10 14:58:40,281 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 88
[2018-10-10 14:58:40,558 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81
[2018-10-10 14:58:40,780 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79
[2018-10-10 14:58:41,215 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81
[2018-10-10 14:58:52,231 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 77
[2018-10-10 14:58:52,531 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 99
[2018-10-10 14:58:52,919 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92
[2018-10-10 14:58:53,677 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 77
[2018-10-10 14:58:54,003 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 79
[2018-10-10 14:58:54,409 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 74
[2018-10-10 14:58:54,739 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 81
[2018-10-10 14:58:55,144 WARN L178 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 96
[2018-10-10 14:58:55,536 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94
[2018-10-10 14:58:55,831 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 87
[2018-10-10 14:58:56,248 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 89
[2018-10-10 14:58:56,941 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 102
[2018-10-10 14:58:57,773 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 113
[2018-10-10 14:58:58,486 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 109
[2018-10-10 14:58:58,841 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 114
[2018-10-10 14:58:59,226 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119
[2018-10-10 14:58:59,609 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99
[2018-10-10 14:58:59,883 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70
[2018-10-10 14:59:00,129 WARN L178 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 94
[2018-10-10 14:59:00,487 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101
[2018-10-10 14:59:00,942 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61
[2018-10-10 14:59:01,467 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 107
[2018-10-10 14:59:01,803 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117
[2018-10-10 14:59:02,190 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 100
[2018-10-10 14:59:02,947 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 63
[2018-10-10 14:59:03,742 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92
[2018-10-10 14:59:04,750 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87
[2018-10-10 14:59:05,062 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66
[2018-10-10 14:59:05,773 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70
[2018-10-10 14:59:06,004 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78
[2018-10-10 14:59:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:59:06,585 INFO L93 Difference]: Finished difference Result 916 states and 931 transitions.
[2018-10-10 14:59:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states.
[2018-10-10 14:59:06,586 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 228
[2018-10-10 14:59:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:59:06,588 INFO L225 Difference]: With dead ends: 916
[2018-10-10 14:59:06,588 INFO L226 Difference]: Without dead ends: 916
[2018-10-10 14:59:06,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 190 SyntacticMatches, 6 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5266 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=1768, Invalid=20864, Unknown=18, NotChecked=0, Total=22650
[2018-10-10 14:59:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states.
[2018-10-10 14:59:06,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 632.
[2018-10-10 14:59:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states.
[2018-10-10 14:59:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 644 transitions.
[2018-10-10 14:59:06,594 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 644 transitions. Word has length 228
[2018-10-10 14:59:06,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:59:06,594 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 644 transitions.
[2018-10-10 14:59:06,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states.
[2018-10-10 14:59:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 644 transitions.
[2018-10-10 14:59:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2018-10-10 14:59:06,595 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:59:06,595 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:59:06,596 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:59:06,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:59:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 177499241, now seen corresponding path program 1 times
[2018-10-10 14:59:06,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:59:06,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:59:06,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:59:06,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:59:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:59:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:59:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:59:07,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:59:07,721 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:59:07,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:59:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:59:07,802 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:59:07,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:59:07,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:07,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:07,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:59:08,009 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:08,009 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:08,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:59:08,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:08,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:08,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:59:08,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:59:08,314 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 10 treesize of output 9
[2018-10-10 14:59:08,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:08,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:08,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:08,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17
[2018-10-10 14:59:09,571 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 45 treesize of output 39
[2018-10-10 14:59:09,573 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 14 treesize of output 13
[2018-10-10 14:59:09,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:09,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:09,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:09,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:22
[2018-10-10 14:59:09,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-10-10 14:59:09,826 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 14:59:09,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:09,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:09,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:09,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10
[2018-10-10 14:59:09,889 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:09,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21
[2018-10-10 14:59:09,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:09,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:59:09,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11
[2018-10-10 14:59:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:59:10,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:59:10,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30] total 56
[2018-10-10 14:59:10,168 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl
[2018-10-10 14:59:10,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states
[2018-10-10 14:59:10,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants.
[2018-10-10 14:59:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=3042, Unknown=0, NotChecked=0, Total=3192
[2018-10-10 14:59:10,170 INFO L87 Difference]: Start difference. First operand 632 states and 644 transitions. Second operand 57 states.
[2018-10-10 14:59:16,617 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55
[2018-10-10 14:59:17,154 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52
[2018-10-10 14:59:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:59:19,705 INFO L93 Difference]: Finished difference Result 881 states and 896 transitions.
[2018-10-10 14:59:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states.
[2018-10-10 14:59:19,706 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 236
[2018-10-10 14:59:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:59:19,708 INFO L225 Difference]: With dead ends: 881
[2018-10-10 14:59:19,708 INFO L226 Difference]: Without dead ends: 881
[2018-10-10 14:59:19,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 214 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3264 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1588, Invalid=13912, Unknown=0, NotChecked=0, Total=15500
[2018-10-10 14:59:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states.
[2018-10-10 14:59:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 750.
[2018-10-10 14:59:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states.
[2018-10-10 14:59:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 772 transitions.
[2018-10-10 14:59:19,715 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 772 transitions. Word has length 236
[2018-10-10 14:59:19,715 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:59:19,715 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 772 transitions.
[2018-10-10 14:59:19,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states.
[2018-10-10 14:59:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 772 transitions.
[2018-10-10 14:59:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2018-10-10 14:59:19,716 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:59:19,716 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:59:19,717 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:59:19,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:59:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1207509455, now seen corresponding path program 1 times
[2018-10-10 14:59:19,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:59:19,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:59:19,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:59:19,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:59:19,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:59:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:59:20,475 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14
[2018-10-10 14:59:20,674 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 14
[2018-10-10 14:59:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:59:23,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:59:23,571 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:59:23,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:59:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:59:23,655 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:59:23,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:59:23,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:23,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:23,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:59:23,910 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:23,911 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:23,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:59:23,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:23,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:23,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:59:24,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:59:24,195 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 10 treesize of output 9
[2018-10-10 14:59:24,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:24,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:24,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:59:24,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-10-10 14:59:24,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:24,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:24,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:24,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26
[2018-10-10 14:59:24,952 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 70 treesize of output 64
[2018-10-10 14:59:24,973 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 14 treesize of output 13
[2018-10-10 14:59:24,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:24,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34
[2018-10-10 14:59:25,013 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 14 treesize of output 13
[2018-10-10 14:59:25,013 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:82, output treesize:31
[2018-10-10 14:59:25,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-10-10 14:59:25,442 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 14:59:25,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-10-10 14:59:25,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3
[2018-10-10 14:59:25,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:25,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9
[2018-10-10 14:59:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:59:25,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:59:25,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 29] total 68
[2018-10-10 14:59:25,805 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/alternating_list_true-unreach-call_true-valid-memsafety.i_48.bpl
[2018-10-10 14:59:25,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states
[2018-10-10 14:59:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants.
[2018-10-10 14:59:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=4473, Unknown=0, NotChecked=0, Total=4692
[2018-10-10 14:59:25,806 INFO L87 Difference]: Start difference. First operand 750 states and 772 transitions. Second operand 69 states.
[2018-10-10 14:59:27,910 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50
[2018-10-10 14:59:28,259 WARN L178 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64
[2018-10-10 14:59:28,878 WARN L178 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 75
[2018-10-10 14:59:29,393 WARN L178 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 84
[2018-10-10 14:59:30,020 WARN L178 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 90
[2018-10-10 14:59:30,581 WARN L178 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 92
[2018-10-10 14:59:31,024 WARN L178 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 86
[2018-10-10 14:59:31,412 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84
[2018-10-10 14:59:31,901 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 87
[2018-10-10 14:59:32,394 WARN L178 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 89
[2018-10-10 14:59:33,036 WARN L178 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 102
[2018-10-10 14:59:33,491 WARN L178 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 94
[2018-10-10 14:59:34,191 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56
[2018-10-10 14:59:34,508 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68
[2018-10-10 14:59:34,803 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74
[2018-10-10 14:59:35,112 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80
[2018-10-10 14:59:35,503 WARN L178 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88
[2018-10-10 14:59:35,927 WARN L178 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 94
[2018-10-10 14:59:36,370 WARN L178 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 93
[2018-10-10 14:59:36,651 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58
[2018-10-10 14:59:36,931 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66
[2018-10-10 14:59:37,346 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 54
[2018-10-10 14:59:38,144 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 58
[2018-10-10 14:59:39,500 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 62
[2018-10-10 14:59:39,948 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 68
[2018-10-10 14:59:40,234 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 63
[2018-10-10 14:59:41,225 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58
[2018-10-10 14:59:41,959 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 73
[2018-10-10 14:59:42,250 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 73
[2018-10-10 14:59:42,486 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 68
[2018-10-10 14:59:42,796 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56
[2018-10-10 14:59:43,049 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63
[2018-10-10 14:59:43,644 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58
[2018-10-10 14:59:43,997 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54
[2018-10-10 14:59:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-10 14:59:45,067 INFO L93 Difference]: Finished difference Result 882 states and 899 transitions.
[2018-10-10 14:59:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states.
[2018-10-10 14:59:45,067 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 237
[2018-10-10 14:59:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-10 14:59:45,069 INFO L225 Difference]: With dead ends: 882
[2018-10-10 14:59:45,069 INFO L226 Difference]: Without dead ends: 882
[2018-10-10 14:59:45,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 214 SyntacticMatches, 9 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3093 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1648, Invalid=13604, Unknown=0, NotChecked=0, Total=15252
[2018-10-10 14:59:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states.
[2018-10-10 14:59:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 760.
[2018-10-10 14:59:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states.
[2018-10-10 14:59:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 783 transitions.
[2018-10-10 14:59:45,076 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 783 transitions. Word has length 237
[2018-10-10 14:59:45,076 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-10-10 14:59:45,076 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 783 transitions.
[2018-10-10 14:59:45,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states.
[2018-10-10 14:59:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 783 transitions.
[2018-10-10 14:59:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2018-10-10 14:59:45,077 INFO L367 BasicCegarLoop]: Found error trace
[2018-10-10 14:59:45,077 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-10 14:59:45,077 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE]===
[2018-10-10 14:59:45,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier
[2018-10-10 14:59:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1850878887, now seen corresponding path program 2 times
[2018-10-10 14:59:45,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-10 14:59:45,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-10 14:59:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:59:45,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-10 14:59:45,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-10 14:59:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-10 14:59:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:59:48,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-10 14:59:48,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-10 14:59:48,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-10-10 14:59:48,244 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-10-10 14:59:48,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-10-10 14:59:48,249 INFO L273 TraceCheckSpWp]: Computing forward predicates...
[2018-10-10 14:59:48,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-10-10 14:59:48,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:48,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:48,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-10-10 14:59:48,519 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:48,521 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:48,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:59:48,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:48,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:48,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11
[2018-10-10 14:59:48,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-10-10 14:59:48,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9
[2018-10-10 14:59:48,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:48,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:48,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:48,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22
[2018-10-10 14:59:49,241 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:49,243 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:49,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-10-10 14:59:49,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:49,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:49,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24
[2018-10-10 14:59:49,683 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:49,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34
[2018-10-10 14:59:49,690 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 10 treesize of output 9
[2018-10-10 14:59:49,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:49,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:49,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:49,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:35
[2018-10-10 14:59:50,370 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:50,371 INFO L700 Elim1Store]: detected not equals via solver
[2018-10-10 14:59:50,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39
[2018-10-10 14:59:50,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:50,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:59:50,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:64
[2018-10-10 14:59:50,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 77
[2018-10-10 14:59:50,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 68
[2018-10-10 14:59:50,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-10-10 14:59:50,852 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 64 treesize of output 63
[2018-10-10 14:59:50,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:50,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-10-10 14:59:50,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-10-10 14:59:50,919 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:82, output treesize:89
[2018-10-10 14:59:51,401 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 33 treesize of output 25
[2018-10-10 14:59:51,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14
[2018-10-10 14:59:51,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:51,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-10-10 14:59:51,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-10-10 14:59:51,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:15
[2018-10-10 14:59:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-10 14:59:52,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-10 14:59:52,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 40] total 90
[2018-10-10 14:59:52,058 WARN L550 AbstractCegarLoop]: Verification canceled
[2018-10-10 14:59:52,062 WARN L205 ceAbstractionStarter]: Timeout
[2018-10-10 14:59:52,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:59:52 BoogieIcfgContainer
[2018-10-10 14:59:52,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-10 14:59:52,063 INFO L168 Benchmark]: Toolchain (without parser) took 317415.95 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 648.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -128.7 MB). Peak memory consumption was 519.3 MB. Max. memory is 7.1 GB.
[2018-10-10 14:59:52,064 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-10 14:59:52,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
[2018-10-10 14:59:52,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-10 14:59:52,064 INFO L168 Benchmark]: Boogie Preprocessor took 127.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB.
[2018-10-10 14:59:52,065 INFO L168 Benchmark]: RCFGBuilder took 1321.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 78.7 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB.
[2018-10-10 14:59:52,065 INFO L168 Benchmark]: TraceAbstraction took 315444.26 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -81.3 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 583.3 MB). Peak memory consumption was 502.1 MB. Max. memory is 7.1 GB.
[2018-10-10 14:59:52,066 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 455.98 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 62.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Preprocessor took 127.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.9 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 1321.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 78.7 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 315444.26 ms. Allocated memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: -81.3 MB). Free memory was 2.1 GB in the beginning and 1.5 GB in the end (delta: 583.3 MB). Peak memory consumption was 502.1 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 666). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 626). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 664). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 664). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 666). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 49).
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 248 locations, 27 error locations. TIMEOUT Result, 315.3s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 236.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10025 SDtfs, 134043 SDslu, 131227 SDs, 0 SdLazy, 98064 SolverSat, 4154 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 95.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6906 GetRequests, 4450 SyntacticMatches, 72 SemanticMatches, 2384 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48605 ImplicationChecksByTransitivity, 181.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 48 MinimizatonAttempts, 9099 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 64.3s InterpolantComputationTime, 11159 NumberOfCodeBlocks, 11159 NumberOfCodeBlocksAsserted, 76 NumberOfCheckSat, 11083 ConstructedInterpolants, 225 QuantifiedInterpolants, 27878007 SizeOfPredicates, 838 NumberOfNonLiveVariables, 10024 ConjunctsInSsa, 1406 ConjunctsInUnsatCore, 76 InterpolantComputations, 21 PerfectInterpolantSequences, 533/2041 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Received shutdown request...