java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:59:10,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:59:10,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:59:10,873 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:59:10,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:59:10,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:59:10,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:59:10,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:59:10,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:59:10,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:59:10,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:59:10,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:59:10,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:59:10,881 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:59:10,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:59:10,883 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:59:10,885 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:59:10,886 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:59:10,887 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:59:10,888 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:59:10,890 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:59:10,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:59:10,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:59:10,892 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:59:10,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:59:10,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:59:10,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:59:10,894 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:59:10,894 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:59:10,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:59:10,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:59:10,895 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:59:10,903 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:59:10,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:59:10,904 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:59:10,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:59:10,905 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:59:10,906 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:59:10,906 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:59:10,906 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:59:10,906 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:59:10,906 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:59:10,906 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:59:10,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:59:10,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:59:10,906 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:59:10,907 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:59:10,907 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:59:10,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:59:10,940 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:59:10,942 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:59:10,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:59:10,944 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:59:10,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i [2018-02-04 17:59:11,244 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:59:11,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:59:11,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:59:11,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:59:11,249 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:59:11,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7dd1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11, skipping insertion in model container [2018-02-04 17:59:11,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,261 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:59:11,288 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:59:11,385 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:59:11,404 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:59:11,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11 WrapperNode [2018-02-04 17:59:11,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:59:11,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:59:11,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:59:11,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:59:11,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... [2018-02-04 17:59:11,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:59:11,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:59:11,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:59:11,447 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:59:11,448 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 17:59:11,482 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:59:11,482 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:59:11,482 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-04 17:59:11,482 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure list_del [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-04 17:59:11,483 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:59:11,483 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:59:11,483 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure list_del [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-04 17:59:11,484 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:59:11,485 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:59:11,839 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:59:11,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:59:11 BoogieIcfgContainer [2018-02-04 17:59:11,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:59:11,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:59:11,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:59:11,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:59:11,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:59:11" (1/3) ... [2018-02-04 17:59:11,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b037aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:59:11, skipping insertion in model container [2018-02-04 17:59:11,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:59:11" (2/3) ... [2018-02-04 17:59:11,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b037aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:59:11, skipping insertion in model container [2018-02-04 17:59:11,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:59:11" (3/3) ... [2018-02-04 17:59:11,844 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0134_true-valid-memsafety.i [2018-02-04 17:59:11,850 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:59:11,854 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-04 17:59:11,876 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:59:11,876 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:59:11,876 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:59:11,877 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:59:11,877 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:59:11,877 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:59:11,877 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:59:11,877 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:59:11,877 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:59:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-02-04 17:59:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 17:59:11,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:11,895 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 17:59:11,895 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash 8457694, now seen corresponding path program 1 times [2018-02-04 17:59:11,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:11,899 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:11,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:11,928 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:11,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:11,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:11,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:11,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:59:11,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:59:12,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:59:12,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:12,046 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2018-02-04 17:59:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:12,178 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-04 17:59:12,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:59:12,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 17:59:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:12,186 INFO L225 Difference]: With dead ends: 182 [2018-02-04 17:59:12,186 INFO L226 Difference]: Without dead ends: 179 [2018-02-04 17:59:12,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-04 17:59:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-02-04 17:59:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 17:59:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-04 17:59:12,215 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 4 [2018-02-04 17:59:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:12,215 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-04 17:59:12,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:59:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-04 17:59:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 17:59:12,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:12,216 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 17:59:12,216 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:12,216 INFO L82 PathProgramCache]: Analyzing trace with hash 8457695, now seen corresponding path program 1 times [2018-02-04 17:59:12,217 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:12,217 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:12,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,218 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:12,218 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:12,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:12,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:12,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:59:12,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:59:12,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:59:12,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:12,267 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 3 states. [2018-02-04 17:59:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:12,353 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-02-04 17:59:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:59:12,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 17:59:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:12,356 INFO L225 Difference]: With dead ends: 180 [2018-02-04 17:59:12,356 INFO L226 Difference]: Without dead ends: 180 [2018-02-04 17:59:12,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-04 17:59:12,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-04 17:59:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-04 17:59:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-02-04 17:59:12,368 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 4 [2018-02-04 17:59:12,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:12,369 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-02-04 17:59:12,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:59:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-02-04 17:59:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:59:12,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:12,369 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:12,369 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash 809839361, now seen corresponding path program 1 times [2018-02-04 17:59:12,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:12,370 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:12,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:12,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:12,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:12,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:12,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:59:12,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:59:12,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:59:12,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:59:12,428 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 4 states. [2018-02-04 17:59:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:12,531 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-02-04 17:59:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:59:12,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:59:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:12,533 INFO L225 Difference]: With dead ends: 175 [2018-02-04 17:59:12,534 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 17:59:12,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:59:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 17:59:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-04 17:59:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-04 17:59:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-02-04 17:59:12,547 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 16 [2018-02-04 17:59:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:12,547 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-02-04 17:59:12,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:59:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-02-04 17:59:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 17:59:12,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:12,548 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:12,548 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash 809839362, now seen corresponding path program 1 times [2018-02-04 17:59:12,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:12,549 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:12,549 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:12,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:12,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:12,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:12,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:59:12,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:59:12,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:59:12,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:59:12,613 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 4 states. [2018-02-04 17:59:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:12,698 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-02-04 17:59:12,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:59:12,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 17:59:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:12,699 INFO L225 Difference]: With dead ends: 174 [2018-02-04 17:59:12,699 INFO L226 Difference]: Without dead ends: 174 [2018-02-04 17:59:12,700 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:59:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-04 17:59:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-04 17:59:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-04 17:59:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-04 17:59:12,705 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 16 [2018-02-04 17:59:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:12,705 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-04 17:59:12,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:59:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-04 17:59:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:59:12,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:12,706 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:12,706 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:12,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319294, now seen corresponding path program 1 times [2018-02-04 17:59:12,707 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:12,707 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:12,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,707 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:12,708 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:12,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:12,735 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:12,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:12,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:12,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:12,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:12,813 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-02-04 17:59:12,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:12,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:12,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:59:12,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:59:12,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:12,832 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-02-04 17:59:12,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:59:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:12,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:12,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:59:12,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:59:12,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:59:12,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:59:12,845 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 5 states. [2018-02-04 17:59:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:13,057 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-04 17:59:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:59:13,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 17:59:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:13,058 INFO L225 Difference]: With dead ends: 182 [2018-02-04 17:59:13,059 INFO L226 Difference]: Without dead ends: 182 [2018-02-04 17:59:13,059 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:59:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-04 17:59:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-02-04 17:59:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 17:59:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-02-04 17:59:13,063 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 19 [2018-02-04 17:59:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:13,063 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-02-04 17:59:13,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:59:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-02-04 17:59:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:59:13,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:13,063 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:13,063 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:13,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319295, now seen corresponding path program 1 times [2018-02-04 17:59:13,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:13,064 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:13,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:13,064 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:13,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:13,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:13,085 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:13,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:13,085 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:13,086 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:13,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:13,124 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-02-04 17:59:13,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,131 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-02-04 17:59:13,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:59:13,156 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,159 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-02-04 17:59:13,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,170 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,171 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-02-04 17:59:13,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:13,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 17:59:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:13,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:13,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:59:13,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:59:13,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:59:13,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:59:13,230 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 6 states. [2018-02-04 17:59:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:13,534 INFO L93 Difference]: Finished difference Result 223 states and 233 transitions. [2018-02-04 17:59:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:59:13,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 17:59:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:13,535 INFO L225 Difference]: With dead ends: 223 [2018-02-04 17:59:13,535 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 17:59:13,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:59:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 17:59:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 201. [2018-02-04 17:59:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 17:59:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 226 transitions. [2018-02-04 17:59:13,542 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 226 transitions. Word has length 19 [2018-02-04 17:59:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:13,542 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 226 transitions. [2018-02-04 17:59:13,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:59:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 226 transitions. [2018-02-04 17:59:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:59:13,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:13,542 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:13,543 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:13,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678693, now seen corresponding path program 1 times [2018-02-04 17:59:13,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:13,543 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:13,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:13,543 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:13,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:13,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:13,558 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:13,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:13,558 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:13,559 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:13,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:13,599 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-02-04 17:59:13,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:59:13,610 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-02-04 17:59:13,612 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-02-04 17:59:13,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:59:13,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 21 treesize of output 16 [2018-02-04 17:59:13,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,624 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 16 treesize of output 23 [2018-02-04 17:59:13,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-04 17:59:13,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,646 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 17:59:13,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-02-04 17:59:13,685 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 33 [2018-02-04 17:59:13,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 17:59:13,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:13,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:34 [2018-02-04 17:59:13,760 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 24 treesize of output 18 [2018-02-04 17:59:13,767 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:13,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:13,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 17:59:13,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:13,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:13,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:15 [2018-02-04 17:59:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:13,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:13,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:59:13,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:59:13,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:59:13,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:59:13,817 INFO L87 Difference]: Start difference. First operand 201 states and 226 transitions. Second operand 13 states. [2018-02-04 17:59:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:14,391 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions. [2018-02-04 17:59:14,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:59:14,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-02-04 17:59:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:14,392 INFO L225 Difference]: With dead ends: 242 [2018-02-04 17:59:14,392 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 17:59:14,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:59:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 17:59:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 219. [2018-02-04 17:59:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 17:59:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2018-02-04 17:59:14,397 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 22 [2018-02-04 17:59:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:14,397 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2018-02-04 17:59:14,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:59:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2018-02-04 17:59:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:59:14,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:14,398 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:14,398 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678692, now seen corresponding path program 1 times [2018-02-04 17:59:14,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:14,398 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:14,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:14,399 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:14,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:14,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:14,419 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:14,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:14,419 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:14,420 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:14,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:14,455 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-02-04 17:59:14,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,461 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-02-04 17:59:14,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:59:14,476 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-02-04 17:59:14,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:59:14,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,487 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-02-04 17:59:14,488 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-02-04 17:59:14,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-04 17:59:14,507 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 21 treesize of output 16 [2018-02-04 17:59:14,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,510 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 16 treesize of output 23 [2018-02-04 17:59:14,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,524 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 21 treesize of output 16 [2018-02-04 17:59:14,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,527 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 16 treesize of output 23 [2018-02-04 17:59:14,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,531 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-04 17:59:14,552 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,553 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-02-04 17:59:14,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,564 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,565 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-02-04 17:59:14,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:46 [2018-02-04 17:59:14,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,604 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 33 [2018-02-04 17:59:14,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 12 treesize of output 1 [2018-02-04 17:59:14,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,624 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 33 [2018-02-04 17:59:14,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 17:59:14,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:14,636 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:46 [2018-02-04 17:59:14,681 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-02-04 17:59:14,684 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:14,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 17:59:14,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,699 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-02-04 17:59:14,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:14,701 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:14,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 17:59:14,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:14,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:14,712 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:66, output treesize:17 [2018-02-04 17:59:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:14,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:14,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:59:14,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:59:14,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:59:14,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:59:14,754 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand 13 states. [2018-02-04 17:59:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:15,689 INFO L93 Difference]: Finished difference Result 241 states and 268 transitions. [2018-02-04 17:59:15,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:59:15,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-02-04 17:59:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:15,690 INFO L225 Difference]: With dead ends: 241 [2018-02-04 17:59:15,690 INFO L226 Difference]: Without dead ends: 241 [2018-02-04 17:59:15,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:59:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-04 17:59:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2018-02-04 17:59:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-04 17:59:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-02-04 17:59:15,696 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 22 [2018-02-04 17:59:15,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:15,697 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-02-04 17:59:15,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:59:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-02-04 17:59:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:59:15,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:15,698 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:15,698 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash -527497365, now seen corresponding path program 1 times [2018-02-04 17:59:15,698 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:15,698 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:15,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:15,699 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:15,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:15,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:15,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:15,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:15,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:59:15,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:59:15,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:59:15,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:59:15,747 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 7 states. [2018-02-04 17:59:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:15,899 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2018-02-04 17:59:15,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:59:15,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 17:59:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:15,910 INFO L225 Difference]: With dead ends: 224 [2018-02-04 17:59:15,910 INFO L226 Difference]: Without dead ends: 224 [2018-02-04 17:59:15,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:59:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-04 17:59:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2018-02-04 17:59:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 17:59:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2018-02-04 17:59:15,914 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 23 [2018-02-04 17:59:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:15,915 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2018-02-04 17:59:15,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:59:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2018-02-04 17:59:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:59:15,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:15,915 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:15,915 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:15,915 INFO L82 PathProgramCache]: Analyzing trace with hash -527497364, now seen corresponding path program 1 times [2018-02-04 17:59:15,915 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:15,915 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:15,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:15,916 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:15,916 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:15,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:16,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:16,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:59:16,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:59:16,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:59:16,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:59:16,001 INFO L87 Difference]: Start difference. First operand 218 states and 247 transitions. Second operand 8 states. [2018-02-04 17:59:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:16,239 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2018-02-04 17:59:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:59:16,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-04 17:59:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:16,241 INFO L225 Difference]: With dead ends: 222 [2018-02-04 17:59:16,241 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 17:59:16,241 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:59:16,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 17:59:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2018-02-04 17:59:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 17:59:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 243 transitions. [2018-02-04 17:59:16,247 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 243 transitions. Word has length 23 [2018-02-04 17:59:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:16,247 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 243 transitions. [2018-02-04 17:59:16,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:59:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 243 transitions. [2018-02-04 17:59:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:59:16,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:16,248 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:16,248 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash -118827570, now seen corresponding path program 1 times [2018-02-04 17:59:16,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:16,248 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:16,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:16,249 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:16,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:16,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:16,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:16,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:59:16,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:59:16,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:59:16,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:59:16,292 INFO L87 Difference]: Start difference. First operand 218 states and 243 transitions. Second operand 5 states. [2018-02-04 17:59:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:16,380 INFO L93 Difference]: Finished difference Result 217 states and 240 transitions. [2018-02-04 17:59:16,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:59:16,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 17:59:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:16,381 INFO L225 Difference]: With dead ends: 217 [2018-02-04 17:59:16,381 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 17:59:16,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:59:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 17:59:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-04 17:59:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 17:59:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2018-02-04 17:59:16,387 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 25 [2018-02-04 17:59:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:16,387 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2018-02-04 17:59:16,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:59:16,387 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2018-02-04 17:59:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:59:16,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:16,387 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:16,388 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash -118827569, now seen corresponding path program 1 times [2018-02-04 17:59:16,388 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:16,388 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:16,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:16,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:16,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:16,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:16,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:16,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:59:16,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:59:16,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:59:16,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:59:16,442 INFO L87 Difference]: Start difference. First operand 217 states and 240 transitions. Second operand 8 states. [2018-02-04 17:59:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:16,633 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2018-02-04 17:59:16,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:59:16,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-04 17:59:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:16,635 INFO L225 Difference]: With dead ends: 219 [2018-02-04 17:59:16,636 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 17:59:16,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:59:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 17:59:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-02-04 17:59:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-04 17:59:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2018-02-04 17:59:16,641 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 25 [2018-02-04 17:59:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:16,641 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2018-02-04 17:59:16,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:59:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2018-02-04 17:59:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 17:59:16,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:16,642 INFO L351 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] [2018-02-04 17:59:16,642 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:16,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858492, now seen corresponding path program 1 times [2018-02-04 17:59:16,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:16,643 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:16,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:16,643 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:16,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:16,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:16,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:16,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:59:16,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:59:16,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:59:16,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:59:16,705 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand 9 states. [2018-02-04 17:59:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:17,024 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-02-04 17:59:17,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:59:17,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-04 17:59:17,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:17,025 INFO L225 Difference]: With dead ends: 216 [2018-02-04 17:59:17,025 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 17:59:17,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:59:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 17:59:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-04 17:59:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 17:59:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 236 transitions. [2018-02-04 17:59:17,029 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 236 transitions. Word has length 41 [2018-02-04 17:59:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:17,029 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 236 transitions. [2018-02-04 17:59:17,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:59:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 236 transitions. [2018-02-04 17:59:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 17:59:17,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:17,030 INFO L351 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] [2018-02-04 17:59:17,030 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:17,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858493, now seen corresponding path program 1 times [2018-02-04 17:59:17,031 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:17,031 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:17,031 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:17,031 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:17,032 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:17,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:17,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:17,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:59:17,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:59:17,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:59:17,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:59:17,149 INFO L87 Difference]: Start difference. First operand 216 states and 236 transitions. Second operand 11 states. [2018-02-04 17:59:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:17,393 INFO L93 Difference]: Finished difference Result 213 states and 232 transitions. [2018-02-04 17:59:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:59:17,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 17:59:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:17,394 INFO L225 Difference]: With dead ends: 213 [2018-02-04 17:59:17,394 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 17:59:17,395 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:59:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 17:59:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-04 17:59:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 17:59:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 232 transitions. [2018-02-04 17:59:17,399 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 232 transitions. Word has length 41 [2018-02-04 17:59:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:17,400 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 232 transitions. [2018-02-04 17:59:17,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:59:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 232 transitions. [2018-02-04 17:59:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:59:17,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:17,401 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 17:59:17,401 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:17,401 INFO L82 PathProgramCache]: Analyzing trace with hash 873260496, now seen corresponding path program 1 times [2018-02-04 17:59:17,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:17,401 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:17,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:17,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:17,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:17,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:17,424 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:17,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:17,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:17,424 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:17,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:17,475 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-02-04 17:59:17,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:59:17,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:17,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 17:59:17,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:17,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:59:17,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,509 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-02-04 17:59:17,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:59:17,566 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-02-04 17:59:17,568 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-02-04 17:59:17,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:17,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-02-04 17:59:17,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:17,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:17,641 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 17:59:17,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,646 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-02-04 17:59:17,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-02-04 17:59:17,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:17,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:17,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:17,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-02-04 17:59:17,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,684 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-02-04 17:59:17,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:49 [2018-02-04 17:59:17,729 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 41 treesize of output 42 [2018-02-04 17:59:17,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 17:59:17,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:17,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:49 [2018-02-04 17:59:17,808 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 33 treesize of output 25 [2018-02-04 17:59:17,809 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:17,809 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 25 treesize of output 17 [2018-02-04 17:59:17,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:17,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:17,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:59, output treesize:28 [2018-02-04 17:59:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:17,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:59:17,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:59:17,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:59:17,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:59:17,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=359, Unknown=1, NotChecked=0, Total=420 [2018-02-04 17:59:17,883 INFO L87 Difference]: Start difference. First operand 213 states and 232 transitions. Second operand 21 states. [2018-02-04 17:59:18,982 WARN L143 SmtUtils]: Spent 493ms on a formula simplification that was a NOOP. DAG size: 48 [2018-02-04 17:59:19,843 WARN L146 SmtUtils]: Spent 821ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-02-04 17:59:21,181 WARN L146 SmtUtils]: Spent 1300ms on a formula simplification. DAG size of input: 83 DAG size of output 58 [2018-02-04 17:59:21,820 WARN L146 SmtUtils]: Spent 490ms on a formula simplification. DAG size of input: 50 DAG size of output 40 [2018-02-04 17:59:22,475 WARN L146 SmtUtils]: Spent 548ms on a formula simplification. DAG size of input: 57 DAG size of output 47 [2018-02-04 17:59:23,179 WARN L146 SmtUtils]: Spent 630ms on a formula simplification. DAG size of input: 49 DAG size of output 45 [2018-02-04 17:59:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:25,410 INFO L93 Difference]: Finished difference Result 268 states and 289 transitions. [2018-02-04 17:59:25,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:59:25,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-02-04 17:59:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:25,411 INFO L225 Difference]: With dead ends: 268 [2018-02-04 17:59:25,411 INFO L226 Difference]: Without dead ends: 268 [2018-02-04 17:59:25,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=279, Invalid=1526, Unknown=1, NotChecked=0, Total=1806 [2018-02-04 17:59:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-02-04 17:59:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 215. [2018-02-04 17:59:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-04 17:59:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 232 transitions. [2018-02-04 17:59:25,424 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 232 transitions. Word has length 48 [2018-02-04 17:59:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:25,424 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 232 transitions. [2018-02-04 17:59:25,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:59:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 232 transitions. [2018-02-04 17:59:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:59:25,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:25,425 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 17:59:25,425 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 873260497, now seen corresponding path program 1 times [2018-02-04 17:59:25,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:25,425 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:25,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:25,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:25,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:25,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:25,450 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:25,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:25,450 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:25,451 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:25,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:25,514 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-02-04 17:59:25,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:59:25,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:25,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 17:59:25,618 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-02-04 17:59:25,620 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-02-04 17:59:25,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,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 11 treesize of output 8 [2018-02-04 17:59:25,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, 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-02-04 17:59:25,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:25,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:33 [2018-02-04 17:59:25,731 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:25,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:25,733 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-02-04 17:59:25,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2018-02-04 17:59:25,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:59:25,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:25,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-02-04 17:59:25,818 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 25 treesize of output 26 [2018-02-04 17:59:25,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 17:59:25,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,842 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 23 treesize of output 24 [2018-02-04 17:59:25,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 17:59:25,845 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:25,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:35 [2018-02-04 17:59:25,926 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 17 treesize of output 13 [2018-02-04 17:59:25,928 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:25,929 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-02-04 17:59:25,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,944 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-02-04 17:59:25,945 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:25,946 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 11 treesize of output 7 [2018-02-04 17:59:25,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:25,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:25,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:52, output treesize:14 [2018-02-04 17:59:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:26,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:59:26,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 17:59:26,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:59:26,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:59:26,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:59:26,025 INFO L87 Difference]: Start difference. First operand 215 states and 232 transitions. Second operand 22 states. [2018-02-04 17:59:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:28,057 INFO L93 Difference]: Finished difference Result 265 states and 285 transitions. [2018-02-04 17:59:28,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 17:59:28,058 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-02-04 17:59:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:28,059 INFO L225 Difference]: With dead ends: 265 [2018-02-04 17:59:28,059 INFO L226 Difference]: Without dead ends: 265 [2018-02-04 17:59:28,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:59:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-04 17:59:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 195. [2018-02-04 17:59:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-04 17:59:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 210 transitions. [2018-02-04 17:59:28,064 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 210 transitions. Word has length 48 [2018-02-04 17:59:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:28,065 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 210 transitions. [2018-02-04 17:59:28,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:59:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 210 transitions. [2018-02-04 17:59:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:59:28,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:28,065 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:28,066 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970133, now seen corresponding path program 1 times [2018-02-04 17:59:28,066 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:28,066 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:28,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:28,067 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:28,067 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:28,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:28,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:28,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:59:28,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:59:28,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:59:28,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:28,098 INFO L87 Difference]: Start difference. First operand 195 states and 210 transitions. Second operand 3 states. [2018-02-04 17:59:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:28,153 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2018-02-04 17:59:28,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:59:28,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 17:59:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:28,154 INFO L225 Difference]: With dead ends: 193 [2018-02-04 17:59:28,154 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 17:59:28,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 17:59:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-04 17:59:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 17:59:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2018-02-04 17:59:28,158 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 48 [2018-02-04 17:59:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:28,158 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2018-02-04 17:59:28,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:59:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2018-02-04 17:59:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 17:59:28,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:28,159 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:28,159 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970134, now seen corresponding path program 1 times [2018-02-04 17:59:28,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:28,160 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:28,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:28,160 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:28,160 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:28,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:28,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:28,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 17:59:28,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:59:28,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:59:28,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:28,201 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand 3 states. [2018-02-04 17:59:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:28,254 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-02-04 17:59:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:59:28,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-04 17:59:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:28,256 INFO L225 Difference]: With dead ends: 191 [2018-02-04 17:59:28,256 INFO L226 Difference]: Without dead ends: 191 [2018-02-04 17:59:28,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:59:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-04 17:59:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-02-04 17:59:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-04 17:59:28,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-02-04 17:59:28,261 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 48 [2018-02-04 17:59:28,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:28,261 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-02-04 17:59:28,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:59:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2018-02-04 17:59:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 17:59:28,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:28,262 INFO L351 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] [2018-02-04 17:59:28,262 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:28,262 INFO L82 PathProgramCache]: Analyzing trace with hash 467934037, now seen corresponding path program 1 times [2018-02-04 17:59:28,263 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:28,263 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:28,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:28,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:28,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:28,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:28,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:28,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:59:28,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:59:28,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:59:28,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:59:28,371 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand 11 states. [2018-02-04 17:59:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:29,002 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-02-04 17:59:29,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 17:59:29,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-04 17:59:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:29,004 INFO L225 Difference]: With dead ends: 275 [2018-02-04 17:59:29,004 INFO L226 Difference]: Without dead ends: 275 [2018-02-04 17:59:29,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:59:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-04 17:59:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 193. [2018-02-04 17:59:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-04 17:59:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2018-02-04 17:59:29,008 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 55 [2018-02-04 17:59:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:29,008 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2018-02-04 17:59:29,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:59:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2018-02-04 17:59:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 17:59:29,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:29,009 INFO L351 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] [2018-02-04 17:59:29,009 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:29,009 INFO L82 PathProgramCache]: Analyzing trace with hash 467934038, now seen corresponding path program 1 times [2018-02-04 17:59:29,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:29,009 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:29,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:29,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:29,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:29,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:29,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:29,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 17:59:29,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 17:59:29,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 17:59:29,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:59:29,178 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand 12 states. [2018-02-04 17:59:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:29,769 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2018-02-04 17:59:29,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 17:59:29,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-04 17:59:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:29,770 INFO L225 Difference]: With dead ends: 223 [2018-02-04 17:59:29,770 INFO L226 Difference]: Without dead ends: 223 [2018-02-04 17:59:29,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:59:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-04 17:59:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-02-04 17:59:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 17:59:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2018-02-04 17:59:29,772 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 55 [2018-02-04 17:59:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:29,773 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2018-02-04 17:59:29,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 17:59:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2018-02-04 17:59:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 17:59:29,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:29,773 INFO L351 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] [2018-02-04 17:59:29,773 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1242217214, now seen corresponding path program 1 times [2018-02-04 17:59:29,773 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:29,773 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:29,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:29,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:29,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:29,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:29,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:29,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 17:59:29,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:59:29,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:59:29,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:59:29,897 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand 16 states. [2018-02-04 17:59:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:30,861 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-02-04 17:59:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 17:59:30,863 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-04 17:59:30,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:30,864 INFO L225 Difference]: With dead ends: 233 [2018-02-04 17:59:30,864 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 17:59:30,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:59:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 17:59:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2018-02-04 17:59:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 17:59:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-02-04 17:59:30,869 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 58 [2018-02-04 17:59:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:30,869 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-02-04 17:59:30,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:59:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-02-04 17:59:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 17:59:30,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:30,870 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:30,870 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1552523800, now seen corresponding path program 1 times [2018-02-04 17:59:30,870 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:30,870 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:30,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:30,872 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:30,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:30,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:30,889 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:30,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:30,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:30,890 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:30,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:30,926 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-02-04 17:59:30,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:59:30,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:30,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 17:59:30,965 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-02-04 17:59:30,966 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-02-04 17:59:30,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 17:59:30,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:30,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:30,996 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-02-04 17:59:30,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:30,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:8 [2018-02-04 17:59:31,009 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 8 treesize of output 6 [2018-02-04 17:59:31,011 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-02-04 17:59:31,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:31,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:31,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:31,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-02-04 17:59:31,022 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 16 treesize of output 12 [2018-02-04 17:59:31,022 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-02-04 17:59:31,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:31,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:31,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:31,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-02-04 17:59:31,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:31,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-02-04 17:59:31,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:31,055 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 2 xjuncts. [2018-02-04 17:59:31,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:22 [2018-02-04 17:59:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:31,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:59:31,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 17:59:31,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 17:59:31,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 17:59:31,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:59:31,075 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 16 states. [2018-02-04 17:59:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:31,949 INFO L93 Difference]: Finished difference Result 242 states and 264 transitions. [2018-02-04 17:59:31,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 17:59:31,949 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-02-04 17:59:31,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:31,950 INFO L225 Difference]: With dead ends: 242 [2018-02-04 17:59:31,950 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 17:59:31,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=1479, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 17:59:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 17:59:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 198. [2018-02-04 17:59:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-04 17:59:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 212 transitions. [2018-02-04 17:59:31,954 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 212 transitions. Word has length 60 [2018-02-04 17:59:31,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:31,954 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 212 transitions. [2018-02-04 17:59:31,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 17:59:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 212 transitions. [2018-02-04 17:59:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 17:59:31,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:31,955 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 17:59:31,955 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:31,955 INFO L82 PathProgramCache]: Analyzing trace with hash 11633541, now seen corresponding path program 1 times [2018-02-04 17:59:31,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:31,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:31,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:31,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:31,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:31,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:31,974 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:31,974 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:31,974 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:31,974 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:32,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:32,023 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-02-04 17:59:32,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:59:32,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:32,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 17:59:32,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,059 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 5 [2018-02-04 17:59:32,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,061 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-02-04 17:59:32,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-02-04 17:59:32,115 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-02-04 17:59:32,117 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-02-04 17:59:32,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:32,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-02-04 17:59:32,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,190 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 25 treesize of output 29 [2018-02-04 17:59:32,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,196 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-02-04 17:59:32,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-02-04 17:59:32,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,218 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-02-04 17:59:32,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,226 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-02-04 17:59:32,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:49 [2018-02-04 17:59:32,247 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 37 treesize of output 38 [2018-02-04 17:59:32,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:59:32,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:32,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-02-04 17:59:32,291 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 46 treesize of output 45 [2018-02-04 17:59:32,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 17:59:32,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,329 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-02-04 17:59:32,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:65 [2018-02-04 17:59:32,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-02-04 17:59:32,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:32,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 17:59:32,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,478 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:32,479 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 25 treesize of output 17 [2018-02-04 17:59:32,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:32,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:32,491 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:72, output treesize:28 [2018-02-04 17:59:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:32,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:32,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 17:59:32,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:59:32,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:59:32,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=392, Unknown=1, NotChecked=0, Total=462 [2018-02-04 17:59:32,591 INFO L87 Difference]: Start difference. First operand 198 states and 212 transitions. Second operand 22 states. [2018-02-04 17:59:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:34,715 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2018-02-04 17:59:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 17:59:34,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-02-04 17:59:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:34,716 INFO L225 Difference]: With dead ends: 292 [2018-02-04 17:59:34,716 INFO L226 Difference]: Without dead ends: 292 [2018-02-04 17:59:34,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=1699, Unknown=1, NotChecked=0, Total=1980 [2018-02-04 17:59:34,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-04 17:59:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 234. [2018-02-04 17:59:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 17:59:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 257 transitions. [2018-02-04 17:59:34,721 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 257 transitions. Word has length 65 [2018-02-04 17:59:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:34,721 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 257 transitions. [2018-02-04 17:59:34,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:59:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 257 transitions. [2018-02-04 17:59:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 17:59:34,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:34,722 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 17:59:34,722 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash 11633542, now seen corresponding path program 1 times [2018-02-04 17:59:34,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:34,722 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:34,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:34,723 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:34,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:34,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:34,762 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:34,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:34,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:34,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:34,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:34,821 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-02-04 17:59:34,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:59:34,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:34,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 17:59:34,849 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:34,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:59:34,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,851 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-02-04 17:59:34,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:59:34,905 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-02-04 17:59:34,907 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-02-04 17:59:34,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,920 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-02-04 17:59:34,922 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-02-04 17:59:34,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:34,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:34,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:31 [2018-02-04 17:59:35,021 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 17:59:35,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:45 [2018-02-04 17:59:35,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 39 [2018-02-04 17:59:35,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-02-04 17:59:35,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-02-04 17:59:35,099 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 35 treesize of output 36 [2018-02-04 17:59:35,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:59:35,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,116 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 34 treesize of output 35 [2018-02-04 17:59:35,118 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-02-04 17:59:35,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-02-04 17:59:35,177 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 43 treesize of output 42 [2018-02-04 17:59:35,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,179 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 16 treesize of output 23 [2018-02-04 17:59:35,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,198 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 43 [2018-02-04 17:59:35,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 17:59:35,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:35,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:72 [2018-02-04 17:59:35,246 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 47 treesize of output 41 [2018-02-04 17:59:35,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 17:59:35,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,256 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 25 treesize of output 16 [2018-02-04 17:59:35,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-02-04 17:59:35,268 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 20 treesize of output 11 [2018-02-04 17:59:35,268 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:35,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 17:59:35,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,275 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:35,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:35,280 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:86, output treesize:16 [2018-02-04 17:59:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:35,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:59:35,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 17:59:35,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:59:35,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:59:35,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:59:35,361 INFO L87 Difference]: Start difference. First operand 234 states and 257 transitions. Second operand 21 states. [2018-02-04 17:59:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:37,335 INFO L93 Difference]: Finished difference Result 304 states and 335 transitions. [2018-02-04 17:59:37,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 17:59:37,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 65 [2018-02-04 17:59:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:37,336 INFO L225 Difference]: With dead ends: 304 [2018-02-04 17:59:37,336 INFO L226 Difference]: Without dead ends: 304 [2018-02-04 17:59:37,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=1638, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 17:59:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-04 17:59:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 234. [2018-02-04 17:59:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-02-04 17:59:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 255 transitions. [2018-02-04 17:59:37,341 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 255 transitions. Word has length 65 [2018-02-04 17:59:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:37,341 INFO L432 AbstractCegarLoop]: Abstraction has 234 states and 255 transitions. [2018-02-04 17:59:37,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:59:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 255 transitions. [2018-02-04 17:59:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 17:59:37,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:37,342 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 17:59:37,342 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:37,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1266188342, now seen corresponding path program 1 times [2018-02-04 17:59:37,343 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:37,343 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:37,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:37,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:37,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:37,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 17:59:37,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:37,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 17:59:37,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 17:59:37,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 17:59:37,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:59:37,538 INFO L87 Difference]: Start difference. First operand 234 states and 255 transitions. Second operand 17 states. [2018-02-04 17:59:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:38,112 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2018-02-04 17:59:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:59:38,112 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-02-04 17:59:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:38,113 INFO L225 Difference]: With dead ends: 233 [2018-02-04 17:59:38,113 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 17:59:38,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 17:59:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 17:59:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 210. [2018-02-04 17:59:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-04 17:59:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-02-04 17:59:38,116 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 63 [2018-02-04 17:59:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:38,116 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-02-04 17:59:38,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 17:59:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-02-04 17:59:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 17:59:38,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:38,117 INFO L351 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] [2018-02-04 17:59:38,117 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:38,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238810, now seen corresponding path program 1 times [2018-02-04 17:59:38,117 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:38,117 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:38,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,117 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:38,117 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:38,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 17:59:38,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:38,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:59:38,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:59:38,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:59:38,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:59:38,169 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 5 states. [2018-02-04 17:59:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:38,292 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-04 17:59:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:59:38,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 17:59:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:38,293 INFO L225 Difference]: With dead ends: 217 [2018-02-04 17:59:38,293 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 17:59:38,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:59:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 17:59:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-02-04 17:59:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 17:59:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-02-04 17:59:38,297 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 67 [2018-02-04 17:59:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:38,297 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-02-04 17:59:38,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:59:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-02-04 17:59:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 17:59:38,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:38,298 INFO L351 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] [2018-02-04 17:59:38,298 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238809, now seen corresponding path program 1 times [2018-02-04 17:59:38,298 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:38,298 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:38,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:38,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:38,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 17:59:38,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:38,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:59:38,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:59:38,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:59:38,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:59:38,361 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-02-04 17:59:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:38,532 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-04 17:59:38,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:59:38,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 17:59:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:38,533 INFO L225 Difference]: With dead ends: 216 [2018-02-04 17:59:38,533 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 17:59:38,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:59:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 17:59:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-04 17:59:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-04 17:59:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-04 17:59:38,536 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 67 [2018-02-04 17:59:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:38,536 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-04 17:59:38,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:59:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-04 17:59:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 17:59:38,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:38,537 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 17:59:38,537 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1238184798, now seen corresponding path program 1 times [2018-02-04 17:59:38,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:38,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:38,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:38,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:38,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 17:59:38,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:59:38,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:59:38,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:59:38,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:59:38,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:59:38,582 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 5 states. [2018-02-04 17:59:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:38,610 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2018-02-04 17:59:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:59:38,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-04 17:59:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:38,611 INFO L225 Difference]: With dead ends: 222 [2018-02-04 17:59:38,611 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 17:59:38,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:59:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 17:59:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-04 17:59:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-04 17:59:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-04 17:59:38,613 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 67 [2018-02-04 17:59:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:38,613 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-04 17:59:38,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:59:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-04 17:59:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 17:59:38,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:38,614 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:59:38,614 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923251, now seen corresponding path program 1 times [2018-02-04 17:59:38,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:38,614 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:38,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:38,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:38,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:38,625 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:38,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:38,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:38,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:38,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:38,681 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-02-04 17:59:38,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:59:38,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:38,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 17:59:38,723 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-02-04 17:59:38,724 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-02-04 17:59:38,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:38,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-02-04 17:59:38,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:38,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:38,792 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 15 treesize of output 8 [2018-02-04 17:59:38,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,798 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-02-04 17:59:38,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:18 [2018-02-04 17:59:38,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:38,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:38,863 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-02-04 17:59:38,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,869 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-02-04 17:59:38,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2018-02-04 17:59:38,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 17:59:38,890 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-02-04 17:59:38,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,903 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 20 treesize of output 21 [2018-02-04 17:59:38,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:59:38,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:38,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-02-04 17:59:38,940 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 7 treesize of output 5 [2018-02-04 17:59:38,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:38,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,954 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 29 treesize of output 28 [2018-02-04 17:59:38,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:38,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 17:59:38,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:38,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:38,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:41 [2018-02-04 17:59:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:39,319 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:59:39,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 17:59:39,320 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 17:59:39,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 17:59:39,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:59:39,320 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 24 states. [2018-02-04 17:59:46,402 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 56 DAG size of output 56 [2018-02-04 17:59:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:48,879 INFO L93 Difference]: Finished difference Result 276 states and 296 transitions. [2018-02-04 17:59:48,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 17:59:48,879 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 70 [2018-02-04 17:59:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:48,880 INFO L225 Difference]: With dead ends: 276 [2018-02-04 17:59:48,880 INFO L226 Difference]: Without dead ends: 276 [2018-02-04 17:59:48,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=346, Invalid=2006, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 17:59:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-04 17:59:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 220. [2018-02-04 17:59:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-04 17:59:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 234 transitions. [2018-02-04 17:59:48,884 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 234 transitions. Word has length 70 [2018-02-04 17:59:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:48,884 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 234 transitions. [2018-02-04 17:59:48,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 17:59:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 234 transitions. [2018-02-04 17:59:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 17:59:48,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:48,885 INFO L351 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] [2018-02-04 17:59:48,885 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash 334330969, now seen corresponding path program 1 times [2018-02-04 17:59:48,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:48,885 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:48,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:48,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:48,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:48,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:48,909 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:48,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:48,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:48,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:48,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:48,985 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-02-04 17:59:48,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:48,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:48,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:59:48,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:48,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:48,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:48,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-02-04 17:59:49,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:59:49,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,017 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-02-04 17:59:49,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:59:49,061 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-02-04 17:59:49,062 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-02-04 17:59:49,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-02-04 17:59:49,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-02-04 17:59:49,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,088 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 18 treesize of output 25 [2018-02-04 17:59:49,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 17:59:49,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-02-04 17:59:49,129 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 31 treesize of output 30 [2018-02-04 17:59:49,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 42 [2018-02-04 17:59:49,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:59:49,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:59:49,191 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-02-04 17:59:49,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 8 treesize of output 7 [2018-02-04 17:59:49,192 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 17:59:49,204 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:44, output treesize:85 [2018-02-04 17:59:49,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 17:59:49,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:64 [2018-02-04 17:59:49,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,350 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,351 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 86 [2018-02-04 17:59:49,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:97 [2018-02-04 17:59:49,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-02-04 17:59:49,400 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-02-04 17:59:49,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2018-02-04 17:59:49,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:59:49,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:111 [2018-02-04 17:59:49,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-02-04 17:59:49,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,485 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 16 treesize of output 23 [2018-02-04 17:59:49,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 90 [2018-02-04 17:59:49,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 17:59:49,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:49,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:129 [2018-02-04 17:59:49,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-02-04 17:59:49,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 17:59:49,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,749 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 55 treesize of output 42 [2018-02-04 17:59:49,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:49,765 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:143, output treesize:104 [2018-02-04 17:59:49,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 66 [2018-02-04 17:59:49,959 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-02-04 17:59:49,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:49,969 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-02-04 17:59:49,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:49,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 17:59:49,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:49,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:49,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:49,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:111, output treesize:37 [2018-02-04 17:59:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:59:50,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:59:50,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-04 17:59:50,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 17:59:50,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 17:59:50,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-02-04 17:59:50,142 INFO L87 Difference]: Start difference. First operand 220 states and 234 transitions. Second operand 29 states. [2018-02-04 17:59:53,055 WARN L146 SmtUtils]: Spent 1382ms on a formula simplification. DAG size of input: 96 DAG size of output 61 [2018-02-04 17:59:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:59:55,411 INFO L93 Difference]: Finished difference Result 303 states and 328 transitions. [2018-02-04 17:59:55,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 17:59:55,411 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 76 [2018-02-04 17:59:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:59:55,412 INFO L225 Difference]: With dead ends: 303 [2018-02-04 17:59:55,412 INFO L226 Difference]: Without dead ends: 303 [2018-02-04 17:59:55,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=428, Invalid=2994, Unknown=0, NotChecked=0, Total=3422 [2018-02-04 17:59:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-04 17:59:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 231. [2018-02-04 17:59:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-04 17:59:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2018-02-04 17:59:55,416 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 76 [2018-02-04 17:59:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:59:55,416 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2018-02-04 17:59:55,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 17:59:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2018-02-04 17:59:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 17:59:55,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:59:55,416 INFO L351 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] [2018-02-04 17:59:55,416 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 17:59:55,417 INFO L82 PathProgramCache]: Analyzing trace with hash 334330970, now seen corresponding path program 1 times [2018-02-04 17:59:55,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:59:55,417 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:59:55,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:55,417 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:55,417 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:59:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:55,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:59:55,432 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:59:55,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:59:55,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:59:55,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:59:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:59:55,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:59:55,536 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-02-04 17:59:55,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,541 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-02-04 17:59:55,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:59:55,554 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-02-04 17:59:55,556 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-02-04 17:59:55,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,567 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-02-04 17:59:55,569 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-02-04 17:59:55,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-02-04 17:59:55,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 17:59:55,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:55,593 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 16 treesize of output 23 [2018-02-04 17:59:55,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,612 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 21 treesize of output 16 [2018-02-04 17:59:55,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:55,615 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 16 treesize of output 23 [2018-02-04 17:59:55,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-04 17:59:55,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:55,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 17:59:55,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,709 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-02-04 17:59:55,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:55,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 17:59:55,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,720 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-02-04 17:59:55,722 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:55,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 17:59:55,722 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,727 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,731 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:58, output treesize:16 [2018-02-04 17:59:55,786 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-02-04 17:59:55,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:55,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 17:59:55,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,825 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 15 treesize of output 12 [2018-02-04 17:59:55,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-04 17:59:55,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:55,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:55,837 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:57, output treesize:20 [2018-02-04 17:59:56,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:56,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:56,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:56,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:56,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-02-04 17:59:56,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:312, output treesize:578 [2018-02-04 17:59:57,198 WARN L146 SmtUtils]: Spent 478ms on a formula simplification. DAG size of input: 128 DAG size of output 79 [2018-02-04 17:59:57,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,210 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 17:59:57,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,306 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:57,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 17:59:57,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,415 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 363 treesize of output 311 [2018-02-04 17:59:57,420 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-02-04 17:59:57,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,461 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:57,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 239 [2018-02-04 17:59:57,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,551 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:57,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,553 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:57,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 250 [2018-02-04 17:59:57,554 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,558 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:57,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,559 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:57,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 259 [2018-02-04 17:59:57,560 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,693 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 241 [2018-02-04 17:59:57,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-02-04 17:59:57,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-02-04 17:59:57,710 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,723 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:57,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 235 [2018-02-04 17:59:57,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 246 [2018-02-04 17:59:57,789 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,913 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:57,914 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 200 treesize of output 219 [2018-02-04 17:59:57,914 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:57,974 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:59:58,055 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:59:58,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,064 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 248 [2018-02-04 17:59:58,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-02-04 17:59:58,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2018-02-04 17:59:58,076 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:58,087 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:58,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,118 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 235 [2018-02-04 17:59:58,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,128 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:58,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,149 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 84 [2018-02-04 17:59:58,150 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:58,206 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:58,266 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:58,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-02-04 17:59:58,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-02-04 17:59:58,844 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 233 treesize of output 197 [2018-02-04 17:59:58,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:59:58,847 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:58,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,878 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 96 [2018-02-04 17:59:58,906 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:58,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,908 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:58,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-02-04 17:59:58,909 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:58,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 113 [2018-02-04 17:59:58,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-02-04 17:59:58,938 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:58,939 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 36 treesize of output 61 [2018-02-04 17:59:58,939 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:58,946 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:58,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 111 [2018-02-04 17:59:58,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:58,966 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:58,979 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 151 [2018-02-04 17:59:58,980 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,021 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,052 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,088 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,132 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,142 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 241 treesize of output 193 [2018-02-04 17:59:59,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:59:59,145 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 103 [2018-02-04 17:59:59,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,216 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,217 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,218 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-02-04 17:59:59,218 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 105 [2018-02-04 17:59:59,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-02-04 17:59:59,262 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,264 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 48 treesize of output 76 [2018-02-04 17:59:59,264 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,270 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 113 [2018-02-04 17:59:59,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,291 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,291 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,294 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,316 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 115 [2018-02-04 17:59:59,318 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,373 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,426 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 114 [2018-02-04 17:59:59,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-02-04 17:59:59,445 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,447 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 36 treesize of output 61 [2018-02-04 17:59:59,448 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,453 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 153 [2018-02-04 17:59:59,475 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 26 treesize of output 28 [2018-02-04 17:59:59,475 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,488 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,497 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,539 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 17:59:59,590 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 17:59:59,596 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 253 treesize of output 207 [2018-02-04 17:59:59,599 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-02-04 17:59:59,599 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 107 [2018-02-04 17:59:59,677 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,678 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,678 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-02-04 17:59:59,679 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 106 [2018-02-04 17:59:59,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 17:59:59,707 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-02-04 17:59:59,709 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,715 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,728 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 119 [2018-02-04 17:59:59,733 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,734 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,737 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:59:59,745 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 129 [2018-02-04 17:59:59,746 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,787 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,818 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,859 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,916 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 17:59:59,925 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 245 treesize of output 199 [2018-02-04 17:59:59,929 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-02-04 17:59:59,929 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-04 17:59:59,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:59:59,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 107 [2018-02-04 18:00:00,001 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,004 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-02-04 18:00:00,004 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:00,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 106 [2018-02-04 18:00:00,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 18:00:00,039 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,040 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 50 treesize of output 88 [2018-02-04 18:00:00,040 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:00,050 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:00,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 119 [2018-02-04 18:00:00,076 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,077 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,081 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,093 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 129 [2018-02-04 18:00:00,094 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,142 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,173 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,207 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,252 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,258 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 256 treesize of output 210 [2018-02-04 18:00:00,260 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-02-04 18:00:00,261 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:00,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 107 [2018-02-04 18:00:00,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,314 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,315 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 62 [2018-02-04 18:00:00,316 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:00,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 106 [2018-02-04 18:00:00,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-02-04 18:00:00,343 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,344 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 50 treesize of output 88 [2018-02-04 18:00:00,345 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:00,352 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:00,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 119 [2018-02-04 18:00:00,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:00,373 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:00,387 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 106 [2018-02-04 18:00:00,388 INFO L267 ElimStorePlain]: Start of recursive call 69: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,424 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,455 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,484 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,522 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:00,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 15 xjuncts. [2018-02-04 18:00:00,963 INFO L202 ElimStorePlain]: Needed 69 recursive calls to eliminate 10 variables, input treesize:607, output treesize:3162 [2018-02-04 18:00:01,255 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 278 DAG size of output 68 [2018-02-04 18:00:01,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,645 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 145 [2018-02-04 18:00:01,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:01,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,766 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 140 [2018-02-04 18:00:01,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:01,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 18:00:01,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:284, output treesize:270 [2018-02-04 18:00:01,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 160 [2018-02-04 18:00:01,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:00:01,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:01,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:01,982 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:01,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 186 [2018-02-04 18:00:02,029 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 235 [2018-02-04 18:00:02,031 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-02-04 18:00:02,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 161 [2018-02-04 18:00:02,189 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:02,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:00:02,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,410 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 250 [2018-02-04 18:00:02,429 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 96 [2018-02-04 18:00:02,430 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:02,469 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:02,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,476 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,480 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 161 treesize of output 257 [2018-02-04 18:00:02,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 247 [2018-02-04 18:00:02,503 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:02,611 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:02,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 209 [2018-02-04 18:00:02,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:00:02,705 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:02,724 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:02,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 18:00:02,795 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:314, output treesize:516 [2018-02-04 18:00:02,978 WARN L143 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 84 [2018-02-04 18:00:02,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 237 [2018-02-04 18:00:02,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:02,992 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 16 treesize of output 23 [2018-02-04 18:00:02,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:03,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:03,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,146 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 210 treesize of output 224 [2018-02-04 18:00:03,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,191 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 278 [2018-02-04 18:00:03,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-02-04 18:00:03,386 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 212 [2018-02-04 18:00:03,386 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:03,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:00:03,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 269 [2018-02-04 18:00:03,712 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 163 [2018-02-04 18:00:03,713 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-02-04 18:00:03,756 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:03,758 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,761 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 320 [2018-02-04 18:00:03,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,802 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 286 treesize of output 320 [2018-02-04 18:00:03,802 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:00:03,906 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:03,906 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 201 treesize of output 208 [2018-02-04 18:00:03,907 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:03,945 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,101 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 200 [2018-02-04 18:00:04,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:00:04,107 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,128 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 342 [2018-02-04 18:00:04,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,288 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 186 [2018-02-04 18:00:04,288 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:00:04,324 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,441 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 355 [2018-02-04 18:00:04,448 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:04,448 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 101 treesize of output 125 [2018-02-04 18:00:04,448 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,472 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 18:00:04,568 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 11 variables, input treesize:728, output treesize:977 [2018-02-04 18:00:04,849 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 221 treesize of output 216 [2018-02-04 18:00:04,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,851 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 280 treesize of output 275 [2018-02-04 18:00:04,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,856 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 195 treesize of output 190 [2018-02-04 18:00:04,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,858 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 356 treesize of output 351 [2018-02-04 18:00:04,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:04,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 18:00:04,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:1053, output treesize:1033 [2018-02-04 18:00:07,179 WARN L143 SmtUtils]: Spent 2107ms on a formula simplification that was a NOOP. DAG size: 122 [2018-02-04 18:00:07,407 WARN L143 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 122 [2018-02-04 18:00:07,611 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 120 [2018-02-04 18:00:07,818 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 118 [2018-02-04 18:00:08,244 WARN L146 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 184 DAG size of output 56 [2018-02-04 18:00:08,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 150 [2018-02-04 18:00:08,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,260 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 91 [2018-02-04 18:00:08,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-02-04 18:00:08,337 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:00:08,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,381 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 91 [2018-02-04 18:00:08,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-04 18:00:08,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,393 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 87 [2018-02-04 18:00:08,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 18:00:08,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,403 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 93 [2018-02-04 18:00:08,408 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 18:00:08,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,409 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 67 [2018-02-04 18:00:08,410 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-04 18:00:08,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2018-02-04 18:00:08,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,534 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,543 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 39 [2018-02-04 18:00:08,544 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:00:08,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:00:08,563 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,573 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-02-04 18:00:08,573 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,579 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2018-02-04 18:00:08,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,588 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,601 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 39 [2018-02-04 18:00:08,602 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:00:08,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,656 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-02-04 18:00:08,657 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:00:08,665 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,669 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2018-02-04 18:00:08,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,676 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,683 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 41 [2018-02-04 18:00:08,684 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:00:08,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:00:08,700 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,708 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 18:00:08,708 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,713 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 [2018-02-04 18:00:08,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,719 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,726 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 41 [2018-02-04 18:00:08,726 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:00:08,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,740 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,740 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:00:08,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-02-04 18:00:08,741 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:08,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:00:08,749 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,753 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:08,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 18:00:08,772 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:208, output treesize:24 [2018-02-04 18:00:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:00:08,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:00:08,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 18:00:08,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 18:00:08,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 18:00:08,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=903, Unknown=11, NotChecked=0, Total=992 [2018-02-04 18:00:08,940 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 32 states. [2018-02-04 18:00:15,450 WARN L146 SmtUtils]: Spent 311ms on a formula simplification. DAG size of input: 132 DAG size of output 104 [2018-02-04 18:00:45,392 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 92 DAG size of output 90 [2018-02-04 18:00:52,310 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 84 DAG size of output 84 [2018-02-04 18:00:54,719 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 92 DAG size of output 92 [2018-02-04 18:01:01,060 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 124 DAG size of output 124 [2018-02-04 18:01:01,361 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 132 DAG size of output 132 [2018-02-04 18:01:01,944 WARN L146 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 138 DAG size of output 137 [2018-02-04 18:01:02,377 WARN L146 SmtUtils]: Spent 307ms on a formula simplification. DAG size of input: 138 DAG size of output 137 [2018-02-04 18:01:02,768 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 136 DAG size of output 136 [2018-02-04 18:01:03,200 WARN L146 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 142 DAG size of output 137 [2018-02-04 18:01:03,584 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 119 DAG size of output 79 [2018-02-04 18:01:10,100 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 157 DAG size of output 91 [2018-02-04 18:01:12,336 WARN L146 SmtUtils]: Spent 2128ms on a formula simplification. DAG size of input: 165 DAG size of output 99 [2018-02-04 18:01:16,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:01:16,419 INFO L93 Difference]: Finished difference Result 320 states and 348 transitions. [2018-02-04 18:01:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 18:01:16,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 76 [2018-02-04 18:01:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:01:16,420 INFO L225 Difference]: With dead ends: 320 [2018-02-04 18:01:16,421 INFO L226 Difference]: Without dead ends: 320 [2018-02-04 18:01:16,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=445, Invalid=5174, Unknown=81, NotChecked=0, Total=5700 [2018-02-04 18:01:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-02-04 18:01:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 285. [2018-02-04 18:01:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-02-04 18:01:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 306 transitions. [2018-02-04 18:01:16,427 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 306 transitions. Word has length 76 [2018-02-04 18:01:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:01:16,427 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 306 transitions. [2018-02-04 18:01:16,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 18:01:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 306 transitions. [2018-02-04 18:01:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 18:01:16,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:01:16,428 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 18:01:16,429 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 18:01:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash -415915384, now seen corresponding path program 1 times [2018-02-04 18:01:16,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:01:16,429 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:01:16,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:16,430 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:16,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:16,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:01:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 18:01:16,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:01:16,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 18:01:16,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 18:01:16,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 18:01:16,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 18:01:16,489 INFO L87 Difference]: Start difference. First operand 285 states and 306 transitions. Second operand 8 states. [2018-02-04 18:01:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:01:16,727 INFO L93 Difference]: Finished difference Result 328 states and 366 transitions. [2018-02-04 18:01:16,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:01:16,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-02-04 18:01:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:01:16,728 INFO L225 Difference]: With dead ends: 328 [2018-02-04 18:01:16,728 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 18:01:16,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 18:01:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 18:01:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 316. [2018-02-04 18:01:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-04 18:01:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 353 transitions. [2018-02-04 18:01:16,733 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 353 transitions. Word has length 81 [2018-02-04 18:01:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:01:16,733 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 353 transitions. [2018-02-04 18:01:16,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 18:01:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 353 transitions. [2018-02-04 18:01:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 18:01:16,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:01:16,734 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 18:01:16,734 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 18:01:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash -415915383, now seen corresponding path program 1 times [2018-02-04 18:01:16,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:01:16,734 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:01:16,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:16,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:16,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:16,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:01:16,749 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:01:16,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:01:16,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:01:16,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:16,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:01:16,827 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-02-04 18:01:16,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 18:01:16,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:01:16,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-04 18:01:16,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 6 treesize of output 5 [2018-02-04 18:01:16,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-02-04 18:01:16,889 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:16,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 18:01:16,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,892 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-02-04 18:01:16,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:14 [2018-02-04 18:01:16,925 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-02-04 18:01:16,927 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-02-04 18:01:16,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,936 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-02-04 18:01:16,937 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-02-04 18:01:16,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:16,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:16,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:31 [2018-02-04 18:01:16,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:16,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:16,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-02-04 18:01:16,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:42 [2018-02-04 18:01:17,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,020 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 33 [2018-02-04 18:01:17,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,032 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-02-04 18:01:17,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2018-02-04 18:01:17,058 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-02-04 18:01:17,060 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-02-04 18:01:17,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,074 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 29 treesize of output 39 [2018-02-04 18:01:17,075 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 18 treesize of output 16 [2018-02-04 18:01:17,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:50 [2018-02-04 18:01:17,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,109 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 26 treesize of output 25 [2018-02-04 18:01:17,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-02-04 18:01:17,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-02-04 18:01:17,137 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 42 [2018-02-04 18:01:17,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 18:01:17,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:17,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:61 [2018-02-04 18:01:17,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-02-04 18:01:17,388 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-02-04 18:01:17,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,393 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-02-04 18:01:17,394 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:17,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2018-02-04 18:01:17,412 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2018-02-04 18:01:17,412 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,416 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-02-04 18:01:17,416 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:17,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:17,422 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:17 [2018-02-04 18:01:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:01:17,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:01:17,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 18:01:17,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 18:01:17,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 18:01:17,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:01:17,524 INFO L87 Difference]: Start difference. First operand 316 states and 353 transitions. Second operand 26 states. [2018-02-04 18:01:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:01:20,318 INFO L93 Difference]: Finished difference Result 362 states and 404 transitions. [2018-02-04 18:01:20,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 18:01:20,318 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 81 [2018-02-04 18:01:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:01:20,319 INFO L225 Difference]: With dead ends: 362 [2018-02-04 18:01:20,319 INFO L226 Difference]: Without dead ends: 362 [2018-02-04 18:01:20,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=422, Invalid=2997, Unknown=3, NotChecked=0, Total=3422 [2018-02-04 18:01:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-04 18:01:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 327. [2018-02-04 18:01:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-04 18:01:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 366 transitions. [2018-02-04 18:01:20,326 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 366 transitions. Word has length 81 [2018-02-04 18:01:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:01:20,326 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 366 transitions. [2018-02-04 18:01:20,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 18:01:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 366 transitions. [2018-02-04 18:01:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 18:01:20,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:01:20,327 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 18:01:20,327 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 18:01:20,327 INFO L82 PathProgramCache]: Analyzing trace with hash 924539713, now seen corresponding path program 1 times [2018-02-04 18:01:20,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:01:20,327 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:01:20,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:20,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:20,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:20,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:01:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 18:01:20,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:01:20,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 18:01:20,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 18:01:20,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 18:01:20,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 18:01:20,458 INFO L87 Difference]: Start difference. First operand 327 states and 366 transitions. Second operand 14 states. [2018-02-04 18:01:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:01:20,965 INFO L93 Difference]: Finished difference Result 370 states and 417 transitions. [2018-02-04 18:01:20,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 18:01:20,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-02-04 18:01:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:01:20,967 INFO L225 Difference]: With dead ends: 370 [2018-02-04 18:01:20,967 INFO L226 Difference]: Without dead ends: 370 [2018-02-04 18:01:20,968 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-04 18:01:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-04 18:01:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 354. [2018-02-04 18:01:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-04 18:01:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 403 transitions. [2018-02-04 18:01:20,972 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 403 transitions. Word has length 85 [2018-02-04 18:01:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:01:20,972 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 403 transitions. [2018-02-04 18:01:20,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 18:01:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 403 transitions. [2018-02-04 18:01:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 18:01:20,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:01:20,973 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 18:01:20,973 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 18:01:20,973 INFO L82 PathProgramCache]: Analyzing trace with hash 924539714, now seen corresponding path program 1 times [2018-02-04 18:01:20,973 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:01:20,973 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:01:20,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:20,973 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:20,973 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:20,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:01:20,985 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:01:20,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:01:20,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:01:20,986 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:21,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:01:21,087 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-02-04 18:01:21,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,092 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-02-04 18:01:21,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:01:21,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:01:21,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:01:21,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 18:01:21,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,129 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 5 [2018-02-04 18:01:21,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,132 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-02-04 18:01:21,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:21,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2018-02-04 18:01:21,161 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-02-04 18:01:21,162 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-02-04 18:01:21,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:21,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 18:01:21,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,208 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 25 treesize of output 29 [2018-02-04 18:01:21,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,215 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2018-02-04 18:01:21,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:32 [2018-02-04 18:01:21,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-04 18:01:21,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 52 [2018-02-04 18:01:21,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:27 [2018-02-04 18:01:21,307 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 21 treesize of output 22 [2018-02-04 18:01:21,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:01:21,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 18:01:21,334 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 30 treesize of output 29 [2018-02-04 18:01:21,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:01:21,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:21,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-02-04 18:01:21,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:01:21,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:21,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:96, output treesize:91 [2018-02-04 18:01:21,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,837 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 98 [2018-02-04 18:01:21,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-02-04 18:01:21,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:21,852 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 3 [2018-02-04 18:01:21,852 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:01:21,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:21,872 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:21,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-02-04 18:01:21,874 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 3 [2018-02-04 18:01:21,874 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,878 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 15 treesize of output 11 [2018-02-04 18:01:21,878 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,880 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:21,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:21,884 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:122, output treesize:23 [2018-02-04 18:01:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:01:21,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:01:21,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 18:01:21,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 18:01:21,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 18:01:21,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1137, Unknown=1, NotChecked=0, Total=1260 [2018-02-04 18:01:21,998 INFO L87 Difference]: Start difference. First operand 354 states and 403 transitions. Second operand 36 states. [2018-02-04 18:01:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:01:26,611 INFO L93 Difference]: Finished difference Result 399 states and 447 transitions. [2018-02-04 18:01:26,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 18:01:26,611 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 85 [2018-02-04 18:01:26,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:01:26,613 INFO L225 Difference]: With dead ends: 399 [2018-02-04 18:01:26,613 INFO L226 Difference]: Without dead ends: 399 [2018-02-04 18:01:26,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1700 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=726, Invalid=6079, Unknown=1, NotChecked=0, Total=6806 [2018-02-04 18:01:26,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-02-04 18:01:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 359. [2018-02-04 18:01:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-02-04 18:01:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 409 transitions. [2018-02-04 18:01:26,619 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 409 transitions. Word has length 85 [2018-02-04 18:01:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:01:26,619 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 409 transitions. [2018-02-04 18:01:26,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 18:01:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 409 transitions. [2018-02-04 18:01:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 18:01:26,620 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:01:26,620 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-04 18:01:26,620 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-04 18:01:26,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039901, now seen corresponding path program 1 times [2018-02-04 18:01:26,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:01:26,621 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:01:26,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:26,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:26,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:01:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:26,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:01:26,650 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:01:26,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:01:26,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:01:26,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:01:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:01:26,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:01:26,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:26,740 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 5 [2018-02-04 18:01:26,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,744 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-02-04 18:01:26,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-02-04 18:01:26,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:01:26,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:01:26,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:10 [2018-02-04 18:01:26,815 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-02-04 18:01:26,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:26,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 18:01:26,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:26,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2018-02-04 18:01:26,898 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-02-04 18:01:26,901 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-02-04 18:01:26,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:26,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-02-04 18:01:26,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 18:01:26,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 18:01:26,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,982 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 18 treesize of output 17 [2018-02-04 18:01:26,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:26,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,003 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 14 [2018-02-04 18:01:27,005 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-02-04 18:01:27,005 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:27,019 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:63, output treesize:61 [2018-02-04 18:01:27,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,093 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 32 [2018-02-04 18:01:27,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 18:01:27,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:27,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:57 [2018-02-04 18:01:27,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-02-04 18:01:27,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,144 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-02-04 18:01:27,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:55 [2018-02-04 18:01:27,175 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-02-04 18:01:27,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:01:27,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,196 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 23 treesize of output 28 [2018-02-04 18:01:27,198 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-02-04 18:01:27,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:27,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:78 [2018-02-04 18:01:27,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-02-04 18:01:27,243 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:01:27,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,271 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 36 treesize of output 43 [2018-02-04 18:01:27,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:27,273 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 16 treesize of output 23 [2018-02-04 18:01:27,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:27,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:27,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:88 [2018-02-04 18:01:29,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 46 [2018-02-04 18:01:29,583 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:01:29,583 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 11 treesize of output 7 [2018-02-04 18:01:29,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:29,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:01:29,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 18:01:29,603 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:107, output treesize:72 [2018-02-04 18:01:29,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:29,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:29,752 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:01:29,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 65 [2018-02-04 18:01:29,756 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 18:01:29,757 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-02-04 18:01:29,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,765 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:01:29,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-04 18:01:29,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 18:01:29,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:01:29,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:78, output treesize:5 [2018-02-04 18:01:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 18:01:29,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 18:01:29,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-04 18:01:29,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 18:01:29,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 18:01:29,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=900, Unknown=4, NotChecked=0, Total=992 [2018-02-04 18:01:29,888 INFO L87 Difference]: Start difference. First operand 359 states and 409 transitions. Second operand 32 states. [2018-02-04 18:02:26,606 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 94 DAG size of output 94 [2018-02-04 18:02:26,771 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 87 DAG size of output 87 [2018-02-04 18:02:27,055 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 94 DAG size of output 94 [2018-02-04 18:02:27,245 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 97 DAG size of output 97 Received shutdown request... [2018-02-04 18:02:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 18:02:35,398 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 18:02:35,403 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 18:02:35,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:02:35 BoogieIcfgContainer [2018-02-04 18:02:35,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:02:35,403 INFO L168 Benchmark]: Toolchain (without parser) took 204159.20 ms. Allocated memory was 401.6 MB in the beginning and 924.8 MB in the end (delta: 523.2 MB). Free memory was 358.1 MB in the beginning and 633.8 MB in the end (delta: -275.7 MB). Peak memory consumption was 247.5 MB. Max. memory is 5.3 GB. [2018-02-04 18:02:35,404 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.6 MB. Free memory is still 363.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:02:35,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.56 ms. Allocated memory is still 401.6 MB. Free memory was 358.1 MB in the beginning and 344.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:02:35,405 INFO L168 Benchmark]: Boogie Preprocessor took 32.16 ms. Allocated memory is still 401.6 MB. Free memory is still 344.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:02:35,405 INFO L168 Benchmark]: RCFGBuilder took 393.48 ms. Allocated memory is still 401.6 MB. Free memory was 342.1 MB in the beginning and 298.4 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:02:35,405 INFO L168 Benchmark]: TraceAbstraction took 203562.66 ms. Allocated memory was 401.6 MB in the beginning and 924.8 MB in the end (delta: 523.2 MB). Free memory was 298.4 MB in the beginning and 633.8 MB in the end (delta: -335.4 MB). Peak memory consumption was 187.9 MB. Max. memory is 5.3 GB. [2018-02-04 18:02:35,406 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 401.6 MB. Free memory is still 363.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.56 ms. Allocated memory is still 401.6 MB. Free memory was 358.1 MB in the beginning and 344.8 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.16 ms. Allocated memory is still 401.6 MB. Free memory is still 344.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 393.48 ms. Allocated memory is still 401.6 MB. Free memory was 342.1 MB in the beginning and 298.4 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 203562.66 ms. Allocated memory was 401.6 MB in the beginning and 924.8 MB in the end (delta: 523.2 MB). Free memory was 298.4 MB in the beginning and 633.8 MB in the end (delta: -335.4 MB). Peak memory consumption was 187.9 MB. Max. memory is 5.3 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 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (359states) and interpolant automaton (currently 45 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (402 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 179 locations, 55 error locations. TIMEOUT Result, 203.5s OverallTime, 36 OverallIterations, 2 TraceHistogramMax, 177.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4695 SDtfs, 8722 SDslu, 17365 SDs, 0 SdLazy, 45269 SolverSat, 2496 SolverUnsat, 201 SolverUnknown, 0 SolverNotchecked, 114.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1477 GetRequests, 576 SyntacticMatches, 15 SemanticMatches, 886 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8880 ImplicationChecksByTransitivity, 71.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 817 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1718 ConstructedInterpolants, 439 QuantifiedInterpolants, 4185092 SizeOfPredicates, 372 NumberOfNonLiveVariables, 4639 ConjunctsInSsa, 1133 ConjunctsInUnsatCore, 36 InterpolantComputations, 26 PerfectInterpolantSequences, 59/111 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-02-35-411.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-02-35-411.csv Completed graceful shutdown