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_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:24:06,181 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:24:06,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:24:06,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:24:06,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:24:06,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:24:06,196 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:24:06,197 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:24:06,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:24:06,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:24:06,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:24:06,201 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:24:06,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:24:06,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:24:06,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:24:06,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:24:06,206 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:24:06,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:24:06,208 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:24:06,209 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:24:06,211 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:24:06,211 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:24:06,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:24:06,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:24:06,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:24:06,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:24:06,214 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:24:06,215 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:24:06,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:24:06,215 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:24:06,215 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:24:06,216 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:24:06,224 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:24:06,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:24:06,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:24:06,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:24:06,226 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:24:06,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:24:06,226 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:24:06,226 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:24:06,227 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:24:06,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:24:06,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:24:06,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:24:06,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:24:06,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:24:06,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:24:06,228 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:24:06,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:24:06,229 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:24:06,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:24:06,264 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:24:06,269 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:24:06,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:24:06,271 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:24:06,272 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-03 23:24:06,463 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:24:06,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:24:06,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:24:06,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:24:06,469 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:24:06,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2504cdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06, skipping insertion in model container [2018-02-03 23:24:06,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,483 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:24:06,513 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:24:06,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:24:06,621 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:24:06,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06 WrapperNode [2018-02-03 23:24:06,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:24:06,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:24:06,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:24:06,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:24:06,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (1/1) ... [2018-02-03 23:24:06,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:24:06,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:24:06,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:24:06,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:24:06,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (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-03 23:24:06,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:24:06,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:24:06,713 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-03 23:24:06,713 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-03 23:24:06,713 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure list_del [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-03 23:24:06,714 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-03 23:24:06,715 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-03 23:24:06,715 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:24:06,715 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:24:06,715 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:24:06,715 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 23:24:06,715 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 23:24:06,715 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-03 23:24:06,716 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure list_del [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-03 23:24:06,717 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-03 23:24:06,718 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-03 23:24:06,718 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:24:06,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:24:06,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:24:07,098 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:24:07,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:24:07 BoogieIcfgContainer [2018-02-03 23:24:07,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:24:07,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:24:07,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:24:07,101 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:24:07,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:24:06" (1/3) ... [2018-02-03 23:24:07,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41924bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:24:07, skipping insertion in model container [2018-02-03 23:24:07,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:24:06" (2/3) ... [2018-02-03 23:24:07,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41924bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:24:07, skipping insertion in model container [2018-02-03 23:24:07,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:24:07" (3/3) ... [2018-02-03 23:24:07,104 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0134_true-valid-memsafety.i [2018-02-03 23:24:07,109 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:24:07,114 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-03 23:24:07,136 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:24:07,136 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:24:07,136 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:24:07,136 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:24:07,136 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:24:07,136 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:24:07,136 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:24:07,136 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:24:07,137 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:24:07,147 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-02-03 23:24:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:24:07,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:07,155 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:24:07,155 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-03 23:24:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash 8457694, now seen corresponding path program 1 times [2018-02-03 23:24:07,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:07,159 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:07,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,197 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:07,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:07,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:07,280 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-03 23:24:07,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:07,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:24:07,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:24:07,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:24:07,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:24:07,359 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2018-02-03 23:24:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:07,488 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-03 23:24:07,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:24:07,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:24:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:07,497 INFO L225 Difference]: With dead ends: 182 [2018-02-03 23:24:07,498 INFO L226 Difference]: Without dead ends: 179 [2018-02-03 23:24:07,499 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-03 23:24:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-03 23:24:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-02-03 23:24:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-03 23:24:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-03 23:24:07,529 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 4 [2018-02-03 23:24:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:07,529 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-03 23:24:07,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:24:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-03 23:24:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:24:07,529 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:07,530 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:24:07,530 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-03 23:24:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash 8457695, now seen corresponding path program 1 times [2018-02-03 23:24:07,530 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:07,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:07,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:07,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:07,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:07,573 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-03 23:24:07,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:07,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:24:07,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:24:07,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:24:07,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:24:07,575 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 3 states. [2018-02-03 23:24:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:07,658 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-02-03 23:24:07,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:24:07,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:24:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:07,660 INFO L225 Difference]: With dead ends: 180 [2018-02-03 23:24:07,660 INFO L226 Difference]: Without dead ends: 180 [2018-02-03 23:24:07,661 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-03 23:24:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-03 23:24:07,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-03 23:24:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-03 23:24:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-02-03 23:24:07,673 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 4 [2018-02-03 23:24:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:07,674 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-02-03 23:24:07,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:24:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-02-03 23:24:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 23:24:07,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:07,674 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:24:07,675 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-03 23:24:07,675 INFO L82 PathProgramCache]: Analyzing trace with hash 809839361, now seen corresponding path program 1 times [2018-02-03 23:24:07,675 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:07,675 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:07,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,676 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:07,676 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:07,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:07,725 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-03 23:24:07,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:07,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:24:07,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:24:07,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:24:07,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:24:07,727 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 4 states. [2018-02-03 23:24:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:07,846 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-02-03 23:24:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:24:07,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-03 23:24:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:07,848 INFO L225 Difference]: With dead ends: 175 [2018-02-03 23:24:07,848 INFO L226 Difference]: Without dead ends: 175 [2018-02-03 23:24:07,848 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-03 23:24:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-03 23:24:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-03 23:24:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-03 23:24:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-02-03 23:24:07,856 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 16 [2018-02-03 23:24:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:07,856 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-02-03 23:24:07,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:24:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-02-03 23:24:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 23:24:07,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:07,856 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:24:07,856 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-03 23:24:07,857 INFO L82 PathProgramCache]: Analyzing trace with hash 809839362, now seen corresponding path program 1 times [2018-02-03 23:24:07,857 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:07,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:07,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,858 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:07,858 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:07,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:07,928 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-03 23:24:07,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:07,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:24:07,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:24:07,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:24:07,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:24:07,929 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 4 states. [2018-02-03 23:24:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:08,013 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-02-03 23:24:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:24:08,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-03 23:24:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:08,014 INFO L225 Difference]: With dead ends: 174 [2018-02-03 23:24:08,014 INFO L226 Difference]: Without dead ends: 174 [2018-02-03 23:24:08,014 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-03 23:24:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-03 23:24:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-03 23:24:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-03 23:24:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-03 23:24:08,021 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 16 [2018-02-03 23:24:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:08,022 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-03 23:24:08,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:24:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-03 23:24:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:24:08,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:08,023 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-03 23:24:08,023 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-03 23:24:08,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319294, now seen corresponding path program 1 times [2018-02-03 23:24:08,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:08,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:08,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:08,024 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:08,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:08,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:08,110 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-03 23:24:08,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:08,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:24:08,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:24:08,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:24:08,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:24:08,111 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 7 states. [2018-02-03 23:24:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:08,307 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-03 23:24:08,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:24:08,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-03 23:24:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:08,308 INFO L225 Difference]: With dead ends: 182 [2018-02-03 23:24:08,308 INFO L226 Difference]: Without dead ends: 182 [2018-02-03 23:24:08,308 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:24:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-03 23:24:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-02-03 23:24:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-03 23:24:08,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-02-03 23:24:08,313 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 19 [2018-02-03 23:24:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:08,313 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-02-03 23:24:08,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:24:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-02-03 23:24:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:24:08,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:08,314 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-03 23:24:08,314 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-03 23:24:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319295, now seen corresponding path program 1 times [2018-02-03 23:24:08,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:08,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:08,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:08,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:08,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:08,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:08,425 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-03 23:24:08,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:08,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:24:08,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:24:08,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:24:08,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:24:08,426 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 9 states. [2018-02-03 23:24:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:08,759 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-02-03 23:24:08,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:24:08,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-03 23:24:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:08,760 INFO L225 Difference]: With dead ends: 177 [2018-02-03 23:24:08,760 INFO L226 Difference]: Without dead ends: 177 [2018-02-03 23:24:08,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:24:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-03 23:24:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-02-03 23:24:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-03 23:24:08,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-02-03 23:24:08,765 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 19 [2018-02-03 23:24:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:08,765 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-02-03 23:24:08,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:24:08,766 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-02-03 23:24:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 23:24:08,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:08,766 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-03 23:24:08,766 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-03 23:24:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678693, now seen corresponding path program 1 times [2018-02-03 23:24:08,766 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:08,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:08,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:08,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:08,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:08,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:08,861 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-03 23:24:08,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:08,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 23:24:08,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:24:08,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:24:08,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:24:08,863 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 10 states. [2018-02-03 23:24:09,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:09,113 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2018-02-03 23:24:09,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 23:24:09,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-03 23:24:09,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:09,114 INFO L225 Difference]: With dead ends: 203 [2018-02-03 23:24:09,114 INFO L226 Difference]: Without dead ends: 203 [2018-02-03 23:24:09,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:24:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-03 23:24:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2018-02-03 23:24:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-03 23:24:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2018-02-03 23:24:09,118 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 22 [2018-02-03 23:24:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:09,118 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-02-03 23:24:09,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:24:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2018-02-03 23:24:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 23:24:09,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:09,119 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-03 23:24:09,119 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-03 23:24:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678692, now seen corresponding path program 1 times [2018-02-03 23:24:09,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:09,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:09,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:09,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:09,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:09,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:09,301 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-03 23:24:09,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:09,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 23:24:09,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:24:09,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:24:09,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:24:09,302 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 11 states. [2018-02-03 23:24:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:10,014 INFO L93 Difference]: Finished difference Result 362 states and 386 transitions. [2018-02-03 23:24:10,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 23:24:10,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-03 23:24:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:10,016 INFO L225 Difference]: With dead ends: 362 [2018-02-03 23:24:10,016 INFO L226 Difference]: Without dead ends: 362 [2018-02-03 23:24:10,017 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-03 23:24:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-03 23:24:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 290. [2018-02-03 23:24:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-03 23:24:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 356 transitions. [2018-02-03 23:24:10,032 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 356 transitions. Word has length 22 [2018-02-03 23:24:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:10,032 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 356 transitions. [2018-02-03 23:24:10,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:24:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 356 transitions. [2018-02-03 23:24:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 23:24:10,033 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:10,033 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-03 23:24:10,033 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-03 23:24:10,033 INFO L82 PathProgramCache]: Analyzing trace with hash -527497365, now seen corresponding path program 1 times [2018-02-03 23:24:10,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:10,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:10,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,036 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:10,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:10,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:10,084 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-03 23:24:10,085 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:10,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:24:10,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:24:10,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:24:10,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:24:10,086 INFO L87 Difference]: Start difference. First operand 290 states and 356 transitions. Second operand 7 states. [2018-02-03 23:24:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:10,303 INFO L93 Difference]: Finished difference Result 302 states and 364 transitions. [2018-02-03 23:24:10,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:24:10,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-03 23:24:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:10,332 INFO L225 Difference]: With dead ends: 302 [2018-02-03 23:24:10,332 INFO L226 Difference]: Without dead ends: 302 [2018-02-03 23:24:10,332 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-03 23:24:10,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-03 23:24:10,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 206. [2018-02-03 23:24:10,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-03 23:24:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-02-03 23:24:10,339 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 23 [2018-02-03 23:24:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:10,339 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-02-03 23:24:10,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:24:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-02-03 23:24:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 23:24:10,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:10,340 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-03 23:24:10,340 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-03 23:24:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash -527497364, now seen corresponding path program 1 times [2018-02-03 23:24:10,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:10,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:10,341 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:10,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:10,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:10,420 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-03 23:24:10,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:10,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:24:10,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:24:10,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:24:10,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:24:10,421 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 8 states. [2018-02-03 23:24:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:10,616 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-03 23:24:10,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:24:10,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-03 23:24:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:10,618 INFO L225 Difference]: With dead ends: 210 [2018-02-03 23:24:10,618 INFO L226 Difference]: Without dead ends: 210 [2018-02-03 23:24:10,618 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-03 23:24:10,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-03 23:24:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-02-03 23:24:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-03 23:24:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-02-03 23:24:10,623 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 23 [2018-02-03 23:24:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:10,624 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-02-03 23:24:10,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:24:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-02-03 23:24:10,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 23:24:10,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:10,624 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-03 23:24:10,625 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-03 23:24:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash -118827570, now seen corresponding path program 1 times [2018-02-03 23:24:10,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:10,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:10,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:10,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:10,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:10,669 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-03 23:24:10,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:10,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:24:10,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:24:10,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:24:10,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:24:10,670 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 5 states. [2018-02-03 23:24:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:10,788 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-02-03 23:24:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:24:10,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-03 23:24:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:10,791 INFO L225 Difference]: With dead ends: 205 [2018-02-03 23:24:10,791 INFO L226 Difference]: Without dead ends: 205 [2018-02-03 23:24:10,791 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-03 23:24:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-03 23:24:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-03 23:24:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-03 23:24:10,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-02-03 23:24:10,799 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 25 [2018-02-03 23:24:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:10,800 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-02-03 23:24:10,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:24:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-02-03 23:24:10,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 23:24:10,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:10,801 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-03 23:24:10,801 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-03 23:24:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash -118827569, now seen corresponding path program 1 times [2018-02-03 23:24:10,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:10,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:10,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:10,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:10,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:10,880 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-03 23:24:10,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:10,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:24:10,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:24:10,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:24:10,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:24:10,882 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 8 states. [2018-02-03 23:24:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:11,045 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-02-03 23:24:11,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:24:11,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-03 23:24:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:11,047 INFO L225 Difference]: With dead ends: 207 [2018-02-03 23:24:11,047 INFO L226 Difference]: Without dead ends: 207 [2018-02-03 23:24:11,047 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-03 23:24:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-03 23:24:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-02-03 23:24:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-03 23:24:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-02-03 23:24:11,052 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 25 [2018-02-03 23:24:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:11,052 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-02-03 23:24:11,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:24:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-02-03 23:24:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 23:24:11,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:11,053 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-03 23:24:11,053 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-03 23:24:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858492, now seen corresponding path program 1 times [2018-02-03 23:24:11,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:11,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:11,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:11,054 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:11,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:11,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:11,122 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-03 23:24:11,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:11,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:24:11,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:24:11,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:24:11,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:24:11,123 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 9 states. [2018-02-03 23:24:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:11,387 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-02-03 23:24:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:24:11,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-03 23:24:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:11,389 INFO L225 Difference]: With dead ends: 204 [2018-02-03 23:24:11,389 INFO L226 Difference]: Without dead ends: 204 [2018-02-03 23:24:11,389 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-03 23:24:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-03 23:24:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-02-03 23:24:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-03 23:24:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-02-03 23:24:11,393 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 41 [2018-02-03 23:24:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:11,393 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-02-03 23:24:11,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:24:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-02-03 23:24:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 23:24:11,394 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:11,394 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-03 23:24:11,394 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-03 23:24:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858493, now seen corresponding path program 1 times [2018-02-03 23:24:11,395 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:11,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:11,395 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:11,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:11,396 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:11,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:11,505 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-03 23:24:11,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:11,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 23:24:11,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:24:11,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:24:11,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:24:11,506 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 11 states. [2018-02-03 23:24:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:11,919 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-02-03 23:24:11,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:24:11,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-03 23:24:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:11,920 INFO L225 Difference]: With dead ends: 203 [2018-02-03 23:24:11,920 INFO L226 Difference]: Without dead ends: 203 [2018-02-03 23:24:11,922 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:24:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-03 23:24:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-03 23:24:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-03 23:24:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-02-03 23:24:11,928 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 41 [2018-02-03 23:24:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:11,928 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-02-03 23:24:11,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:24:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-02-03 23:24:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:24:11,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:11,929 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-03 23:24:11,930 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-03 23:24:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash 873260496, now seen corresponding path program 1 times [2018-02-03 23:24:11,930 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:11,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:11,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:11,930 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:11,930 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:11,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:24:12,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:24:12,142 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:24:12,148 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:12,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:24:12,449 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-03 23:24:12,452 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-03 23:24:12,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,459 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-03 23:24:12,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-03 23:24:12,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:12,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:12,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:12,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2018-02-03 23:24:12,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-03 23:24:12,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-03 23:24:12,631 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-03 23:24:12,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,639 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-03 23:24:12,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-02-03 23:24:12,726 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 25 treesize of output 19 [2018-02-03 23:24:12,727 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-03 23:24:12,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:12,734 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-03 23:24:12,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-02-03 23:24:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:24:12,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:24:12,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2018-02-03 23:24:12,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-03 23:24:12,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-03 23:24:12,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 23:24:12,838 INFO L87 Difference]: Start difference. First operand 203 states and 216 transitions. Second operand 34 states. [2018-02-03 23:24:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:14,586 INFO L93 Difference]: Finished difference Result 291 states and 309 transitions. [2018-02-03 23:24:14,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-03 23:24:14,586 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-02-03 23:24:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:14,587 INFO L225 Difference]: With dead ends: 291 [2018-02-03 23:24:14,587 INFO L226 Difference]: Without dead ends: 291 [2018-02-03 23:24:14,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=348, Invalid=2304, Unknown=0, NotChecked=0, Total=2652 [2018-02-03 23:24:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-03 23:24:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 212. [2018-02-03 23:24:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-03 23:24:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2018-02-03 23:24:14,594 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 48 [2018-02-03 23:24:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:14,595 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2018-02-03 23:24:14,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-03 23:24:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2018-02-03 23:24:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:24:14,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:14,596 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-03 23:24:14,596 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-03 23:24:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash 873260497, now seen corresponding path program 1 times [2018-02-03 23:24:14,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:14,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:14,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:14,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:14,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:14,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:14,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:24:14,971 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:24:14,971 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:24:14,979 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:15,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:24:15,053 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-03 23:24:15,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-03 23:24:15,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:24:15,222 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-03 23:24:15,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,236 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-03 23:24:15,237 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-03 23:24:15,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,243 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-03 23:24:15,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-02-03 23:24:15,353 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:15,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:15,372 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-03 23:24:15,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,380 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 15 [2018-02-03 23:24:15,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-02-03 23:24:15,441 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 31 [2018-02-03 23:24:15,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:24:15,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,456 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-03 23:24:15,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-03 23:24:15,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,466 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-03 23:24:15,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:36 [2018-02-03 23:24:15,564 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-03 23:24:15,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-03 23:24:15,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,603 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 22 treesize of output 16 [2018-02-03 23:24:15,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-02-03 23:24:15,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:15,612 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-03 23:24:15,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2018-02-03 23:24:15,658 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-03 23:24:15,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:24:15,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2018-02-03 23:24:15,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-03 23:24:15,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-03 23:24:15,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 23:24:15,677 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand 36 states. [2018-02-03 23:24:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:17,405 INFO L93 Difference]: Finished difference Result 273 states and 287 transitions. [2018-02-03 23:24:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-03 23:24:17,405 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2018-02-03 23:24:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:17,406 INFO L225 Difference]: With dead ends: 273 [2018-02-03 23:24:17,407 INFO L226 Difference]: Without dead ends: 273 [2018-02-03 23:24:17,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=399, Invalid=2907, Unknown=0, NotChecked=0, Total=3306 [2018-02-03 23:24:17,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-03 23:24:17,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 195. [2018-02-03 23:24:17,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-03 23:24:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 210 transitions. [2018-02-03 23:24:17,413 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 210 transitions. Word has length 48 [2018-02-03 23:24:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:17,413 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 210 transitions. [2018-02-03 23:24:17,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-03 23:24:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 210 transitions. [2018-02-03 23:24:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:24:17,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:17,414 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-03 23:24:17,414 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-03 23:24:17,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970133, now seen corresponding path program 1 times [2018-02-03 23:24:17,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:17,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:17,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:17,415 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:17,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:17,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:17,457 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-03 23:24:17,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:17,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:24:17,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:24:17,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:24:17,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:24:17,458 INFO L87 Difference]: Start difference. First operand 195 states and 210 transitions. Second operand 3 states. [2018-02-03 23:24:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:17,507 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2018-02-03 23:24:17,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:24:17,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-03 23:24:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:17,509 INFO L225 Difference]: With dead ends: 193 [2018-02-03 23:24:17,509 INFO L226 Difference]: Without dead ends: 193 [2018-02-03 23:24:17,509 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-03 23:24:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-03 23:24:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-03 23:24:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-03 23:24:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2018-02-03 23:24:17,513 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 48 [2018-02-03 23:24:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:17,513 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2018-02-03 23:24:17,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:24:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2018-02-03 23:24:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:24:17,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:17,514 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-03 23:24:17,514 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-03 23:24:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970134, now seen corresponding path program 1 times [2018-02-03 23:24:17,514 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:17,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:17,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:17,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:17,515 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:17,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:17,573 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-03 23:24:17,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:17,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:24:17,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:24:17,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:24:17,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:24:17,574 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand 3 states. [2018-02-03 23:24:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:17,634 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-02-03 23:24:17,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:24:17,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-03 23:24:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:17,635 INFO L225 Difference]: With dead ends: 191 [2018-02-03 23:24:17,635 INFO L226 Difference]: Without dead ends: 191 [2018-02-03 23:24:17,636 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-03 23:24:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-03 23:24:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-02-03 23:24:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-03 23:24:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-02-03 23:24:17,640 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 48 [2018-02-03 23:24:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:17,640 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-02-03 23:24:17,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:24:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2018-02-03 23:24:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-03 23:24:17,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:17,641 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-03 23:24:17,641 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-03 23:24:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 467934037, now seen corresponding path program 1 times [2018-02-03 23:24:17,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:17,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:17,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:17,642 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:17,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:17,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:17,759 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-03 23:24:17,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:17,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 23:24:17,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:24:17,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:24:17,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:24:17,760 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand 11 states. [2018-02-03 23:24:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:18,461 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-02-03 23:24:18,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 23:24:18,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-03 23:24:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:18,462 INFO L225 Difference]: With dead ends: 275 [2018-02-03 23:24:18,462 INFO L226 Difference]: Without dead ends: 275 [2018-02-03 23:24:18,463 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-03 23:24:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-03 23:24:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 193. [2018-02-03 23:24:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-03 23:24:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2018-02-03 23:24:18,468 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 55 [2018-02-03 23:24:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:18,468 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2018-02-03 23:24:18,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:24:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2018-02-03 23:24:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-03 23:24:18,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:18,469 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-03 23:24:18,469 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-03 23:24:18,469 INFO L82 PathProgramCache]: Analyzing trace with hash 467934038, now seen corresponding path program 1 times [2018-02-03 23:24:18,469 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:18,469 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:18,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:18,470 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:18,470 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:18,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:18,660 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-03 23:24:18,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:18,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 23:24:18,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:24:18,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:24:18,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:24:18,661 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand 12 states. [2018-02-03 23:24:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:19,477 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2018-02-03 23:24:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:24:19,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-03 23:24:19,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:19,479 INFO L225 Difference]: With dead ends: 223 [2018-02-03 23:24:19,479 INFO L226 Difference]: Without dead ends: 223 [2018-02-03 23:24:19,479 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-03 23:24:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-03 23:24:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-02-03 23:24:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-03 23:24:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2018-02-03 23:24:19,484 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 55 [2018-02-03 23:24:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:19,484 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2018-02-03 23:24:19,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:24:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2018-02-03 23:24:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-03 23:24:19,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:19,485 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-03 23:24:19,485 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-03 23:24:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1242217214, now seen corresponding path program 1 times [2018-02-03 23:24:19,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:19,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:19,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:19,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:19,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:19,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:19,643 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-03 23:24:19,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:19,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-03 23:24:19,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 23:24:19,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 23:24:19,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:24:19,644 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand 16 states. [2018-02-03 23:24:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:20,504 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-02-03 23:24:20,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-03 23:24:20,505 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-03 23:24:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:20,505 INFO L225 Difference]: With dead ends: 233 [2018-02-03 23:24:20,505 INFO L226 Difference]: Without dead ends: 233 [2018-02-03 23:24:20,506 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-03 23:24:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-03 23:24:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2018-02-03 23:24:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-03 23:24:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-02-03 23:24:20,509 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 58 [2018-02-03 23:24:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:20,509 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-02-03 23:24:20,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 23:24:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-02-03 23:24:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-03 23:24:20,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:20,510 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-03 23:24:20,510 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-03 23:24:20,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1552523800, now seen corresponding path program 1 times [2018-02-03 23:24:20,510 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:20,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:20,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:20,511 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:20,511 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:20,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:20,740 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-03 23:24:20,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:24:20,741 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:24:20,746 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:20,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:24:20,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-03 23:24:20,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-03 23:24:20,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:20,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:20,870 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-03 23:24:20,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-02-03 23:24:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:24:20,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:24:20,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2018-02-03 23:24:20,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 23:24:20,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 23:24:20,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-03 23:24:20,912 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 28 states. [2018-02-03 23:24:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:22,084 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2018-02-03 23:24:22,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-03 23:24:22,084 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-03 23:24:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:22,085 INFO L225 Difference]: With dead ends: 204 [2018-02-03 23:24:22,085 INFO L226 Difference]: Without dead ends: 192 [2018-02-03 23:24:22,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=3201, Unknown=0, NotChecked=0, Total=3660 [2018-02-03 23:24:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-03 23:24:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2018-02-03 23:24:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-03 23:24:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2018-02-03 23:24:22,088 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 60 [2018-02-03 23:24:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:22,088 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2018-02-03 23:24:22,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 23:24:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2018-02-03 23:24:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-03 23:24:22,089 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:22,089 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-03 23:24:22,089 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-03 23:24:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 11633541, now seen corresponding path program 1 times [2018-02-03 23:24:22,089 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:22,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:22,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:22,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:22,090 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:22,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:22,297 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-03 23:24:22,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:22,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-03 23:24:22,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 23:24:22,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 23:24:22,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:24:22,298 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand 17 states. [2018-02-03 23:24:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:22,881 INFO L93 Difference]: Finished difference Result 265 states and 287 transitions. [2018-02-03 23:24:22,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 23:24:22,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-03 23:24:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:22,882 INFO L225 Difference]: With dead ends: 265 [2018-02-03 23:24:22,883 INFO L226 Difference]: Without dead ends: 265 [2018-02-03 23:24:22,883 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-02-03 23:24:22,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-03 23:24:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 210. [2018-02-03 23:24:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-03 23:24:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-02-03 23:24:22,887 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 65 [2018-02-03 23:24:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:22,887 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-02-03 23:24:22,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 23:24:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-02-03 23:24:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-03 23:24:22,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:22,888 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-03 23:24:22,888 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-03 23:24:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 11633542, now seen corresponding path program 1 times [2018-02-03 23:24:22,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:22,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:22,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:22,889 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:22,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:22,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:23,294 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-03 23:24:23,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:23,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-03 23:24:23,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 23:24:23,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 23:24:23,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-03 23:24:23,295 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 20 states. [2018-02-03 23:24:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:24,187 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2018-02-03 23:24:24,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 23:24:24,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-03 23:24:24,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:24,188 INFO L225 Difference]: With dead ends: 258 [2018-02-03 23:24:24,188 INFO L226 Difference]: Without dead ends: 258 [2018-02-03 23:24:24,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 23:24:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-03 23:24:24,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2018-02-03 23:24:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-03 23:24:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-02-03 23:24:24,191 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 65 [2018-02-03 23:24:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:24,191 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-02-03 23:24:24,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 23:24:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-02-03 23:24:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-03 23:24:24,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:24,192 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-03 23:24:24,192 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-03 23:24:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238810, now seen corresponding path program 1 times [2018-02-03 23:24:24,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:24,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:24,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:24,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:24,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:24,225 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-03 23:24:24,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:24,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:24:24,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:24:24,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:24:24,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:24:24,226 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 5 states. [2018-02-03 23:24:24,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:24,356 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-03 23:24:24,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:24:24,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-03 23:24:24,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:24,357 INFO L225 Difference]: With dead ends: 217 [2018-02-03 23:24:24,357 INFO L226 Difference]: Without dead ends: 217 [2018-02-03 23:24:24,358 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-03 23:24:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-03 23:24:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-02-03 23:24:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-03 23:24:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-02-03 23:24:24,361 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 67 [2018-02-03 23:24:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:24,362 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-02-03 23:24:24,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:24:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-02-03 23:24:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-03 23:24:24,362 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:24,362 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-03 23:24:24,363 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-03 23:24:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238809, now seen corresponding path program 1 times [2018-02-03 23:24:24,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:24,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:24,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:24,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:24,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:24,417 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-03 23:24:24,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:24,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:24:24,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:24:24,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:24:24,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:24:24,418 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-02-03 23:24:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:24,554 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-03 23:24:24,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:24:24,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-03 23:24:24,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:24,555 INFO L225 Difference]: With dead ends: 216 [2018-02-03 23:24:24,555 INFO L226 Difference]: Without dead ends: 216 [2018-02-03 23:24:24,555 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-03 23:24:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-03 23:24:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-03 23:24:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-03 23:24:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-03 23:24:24,559 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 67 [2018-02-03 23:24:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:24,559 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-03 23:24:24,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:24:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-03 23:24:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-03 23:24:24,560 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:24,560 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-03 23:24:24,560 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-03 23:24:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1238184798, now seen corresponding path program 1 times [2018-02-03 23:24:24,561 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:24,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:24,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:24,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:24,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:24,619 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-03 23:24:24,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:24,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:24:24,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:24:24,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:24:24,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:24:24,620 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 5 states. [2018-02-03 23:24:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:24,642 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2018-02-03 23:24:24,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:24:24,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-03 23:24:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:24,643 INFO L225 Difference]: With dead ends: 222 [2018-02-03 23:24:24,644 INFO L226 Difference]: Without dead ends: 222 [2018-02-03 23:24:24,644 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-03 23:24:24,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-03 23:24:24,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-03 23:24:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-03 23:24:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-03 23:24:24,647 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 67 [2018-02-03 23:24:24,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:24,648 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-03 23:24:24,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:24:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-03 23:24:24,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-03 23:24:24,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:24,648 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-03 23:24:24,648 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-03 23:24:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923251, now seen corresponding path program 1 times [2018-02-03 23:24:24,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:24,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:24,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:24,650 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:24,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-03 23:24:24,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:24,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:24:24,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:24:24,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:24:24,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:24:24,745 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-02-03 23:24:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:24,997 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2018-02-03 23:24:24,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:24:24,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-03 23:24:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:24,998 INFO L225 Difference]: With dead ends: 244 [2018-02-03 23:24:24,998 INFO L226 Difference]: Without dead ends: 244 [2018-02-03 23:24:24,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:24:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-03 23:24:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2018-02-03 23:24:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-03 23:24:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2018-02-03 23:24:25,001 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 70 [2018-02-03 23:24:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:25,001 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2018-02-03 23:24:25,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:24:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2018-02-03 23:24:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-03 23:24:25,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:25,002 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-03 23:24:25,002 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-03 23:24:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923252, now seen corresponding path program 1 times [2018-02-03 23:24:25,002 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:25,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:25,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:25,002 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:25,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:25,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-03 23:24:25,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:25,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:24:25,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:24:25,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:24:25,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:24:25,123 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand 9 states. [2018-02-03 23:24:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:25,348 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2018-02-03 23:24:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:24:25,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-03 23:24:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:25,349 INFO L225 Difference]: With dead ends: 243 [2018-02-03 23:24:25,349 INFO L226 Difference]: Without dead ends: 243 [2018-02-03 23:24:25,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:24:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-03 23:24:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2018-02-03 23:24:25,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-03 23:24:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2018-02-03 23:24:25,354 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 70 [2018-02-03 23:24:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:25,354 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2018-02-03 23:24:25,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:24:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2018-02-03 23:24:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-03 23:24:25,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:25,355 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:24:25,355 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-03 23:24:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash -200117613, now seen corresponding path program 1 times [2018-02-03 23:24:25,355 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:25,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:25,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:25,356 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:25,356 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:25,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-03 23:24:25,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:25,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 23:24:25,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:24:25,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:24:25,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:24:25,429 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand 10 states. [2018-02-03 23:24:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:25,793 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-02-03 23:24:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:24:25,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-02-03 23:24:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:25,795 INFO L225 Difference]: With dead ends: 249 [2018-02-03 23:24:25,795 INFO L226 Difference]: Without dead ends: 249 [2018-02-03 23:24:25,795 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:24:25,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-03 23:24:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2018-02-03 23:24:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-03 23:24:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-02-03 23:24:25,799 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 71 [2018-02-03 23:24:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:25,800 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-02-03 23:24:25,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:24:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-02-03 23:24:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-03 23:24:25,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:25,801 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:24:25,801 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-03 23:24:25,801 INFO L82 PathProgramCache]: Analyzing trace with hash -200117612, now seen corresponding path program 1 times [2018-02-03 23:24:25,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:25,801 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:25,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:25,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:25,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:25,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-03 23:24:25,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:25,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 23:24:25,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:24:25,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:24:25,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:24:25,962 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 12 states. [2018-02-03 23:24:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:26,249 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2018-02-03 23:24:26,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:24:26,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-02-03 23:24:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:26,250 INFO L225 Difference]: With dead ends: 248 [2018-02-03 23:24:26,250 INFO L226 Difference]: Without dead ends: 248 [2018-02-03 23:24:26,251 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:24:26,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-03 23:24:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-02-03 23:24:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-03 23:24:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2018-02-03 23:24:26,255 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 71 [2018-02-03 23:24:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:26,255 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2018-02-03 23:24:26,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:24:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2018-02-03 23:24:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-03 23:24:26,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:26,256 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:24:26,256 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-03 23:24:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1908678729, now seen corresponding path program 1 times [2018-02-03 23:24:26,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:26,256 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:26,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:26,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:26,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:26,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-03 23:24:26,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:26,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-03 23:24:26,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 23:24:26,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 23:24:26,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-03 23:24:26,572 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand 22 states. [2018-02-03 23:24:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:27,904 INFO L93 Difference]: Finished difference Result 294 states and 320 transitions. [2018-02-03 23:24:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-03 23:24:27,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-02-03 23:24:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:27,905 INFO L225 Difference]: With dead ends: 294 [2018-02-03 23:24:27,906 INFO L226 Difference]: Without dead ends: 294 [2018-02-03 23:24:27,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=2445, Unknown=0, NotChecked=0, Total=2756 [2018-02-03 23:24:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-03 23:24:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 240. [2018-02-03 23:24:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-03 23:24:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 261 transitions. [2018-02-03 23:24:27,909 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 261 transitions. Word has length 72 [2018-02-03 23:24:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:27,909 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 261 transitions. [2018-02-03 23:24:27,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 23:24:27,909 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 261 transitions. [2018-02-03 23:24:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-03 23:24:27,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:27,910 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-03 23:24:27,910 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-03 23:24:27,910 INFO L82 PathProgramCache]: Analyzing trace with hash 334330969, now seen corresponding path program 1 times [2018-02-03 23:24:27,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:27,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:27,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:27,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:27,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:27,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:28,394 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-03 23:24:28,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:28,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-03 23:24:28,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 23:24:28,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 23:24:28,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-02-03 23:24:28,396 INFO L87 Difference]: Start difference. First operand 240 states and 261 transitions. Second operand 27 states. [2018-02-03 23:24:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:30,141 INFO L93 Difference]: Finished difference Result 300 states and 326 transitions. [2018-02-03 23:24:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-03 23:24:30,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-02-03 23:24:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:30,143 INFO L225 Difference]: With dead ends: 300 [2018-02-03 23:24:30,143 INFO L226 Difference]: Without dead ends: 300 [2018-02-03 23:24:30,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=2751, Unknown=0, NotChecked=0, Total=3080 [2018-02-03 23:24:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-03 23:24:30,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2018-02-03 23:24:30,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-03 23:24:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 276 transitions. [2018-02-03 23:24:30,147 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 276 transitions. Word has length 76 [2018-02-03 23:24:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:30,148 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 276 transitions. [2018-02-03 23:24:30,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 23:24:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 276 transitions. [2018-02-03 23:24:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-03 23:24:30,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:30,149 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-03 23:24:30,149 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-03 23:24:30,149 INFO L82 PathProgramCache]: Analyzing trace with hash 334330970, now seen corresponding path program 1 times [2018-02-03 23:24:30,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:30,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:30,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:30,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:30,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:30,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:31,003 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-03 23:24:31,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:31,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-03 23:24:31,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 23:24:31,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 23:24:31,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-02-03 23:24:31,004 INFO L87 Difference]: Start difference. First operand 251 states and 276 transitions. Second operand 28 states. [2018-02-03 23:24:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:33,227 INFO L93 Difference]: Finished difference Result 342 states and 378 transitions. [2018-02-03 23:24:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-03 23:24:33,227 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-02-03 23:24:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:33,228 INFO L225 Difference]: With dead ends: 342 [2018-02-03 23:24:33,228 INFO L226 Difference]: Without dead ends: 342 [2018-02-03 23:24:33,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=322, Invalid=2434, Unknown=0, NotChecked=0, Total=2756 [2018-02-03 23:24:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-03 23:24:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 297. [2018-02-03 23:24:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-03 23:24:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-02-03 23:24:33,233 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 76 [2018-02-03 23:24:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:33,233 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-02-03 23:24:33,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 23:24:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-02-03 23:24:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-03 23:24:33,234 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:33,234 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-03 23:24:33,234 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-03 23:24:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash -415915384, now seen corresponding path program 1 times [2018-02-03 23:24:33,235 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:33,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:33,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:33,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:33,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:33,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:33,308 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-03 23:24:33,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:33,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:24:33,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:24:33,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:24:33,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:24:33,309 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 8 states. [2018-02-03 23:24:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:33,523 INFO L93 Difference]: Finished difference Result 343 states and 390 transitions. [2018-02-03 23:24:33,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:24:33,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-02-03 23:24:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:33,524 INFO L225 Difference]: With dead ends: 343 [2018-02-03 23:24:33,525 INFO L226 Difference]: Without dead ends: 343 [2018-02-03 23:24:33,525 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-03 23:24:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-03 23:24:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 330. [2018-02-03 23:24:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-03 23:24:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 375 transitions. [2018-02-03 23:24:33,529 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 375 transitions. Word has length 81 [2018-02-03 23:24:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:33,530 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 375 transitions. [2018-02-03 23:24:33,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:24:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-02-03 23:24:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-03 23:24:33,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:33,530 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-03 23:24:33,530 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-03 23:24:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash -415915383, now seen corresponding path program 1 times [2018-02-03 23:24:33,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:33,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:33,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:33,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:33,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:33,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:34,006 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-03 23:24:34,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:34,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-03 23:24:34,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-03 23:24:34,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-03 23:24:34,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-02-03 23:24:34,007 INFO L87 Difference]: Start difference. First operand 330 states and 375 transitions. Second operand 25 states. [2018-02-03 23:24:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:35,487 INFO L93 Difference]: Finished difference Result 369 states and 412 transitions. [2018-02-03 23:24:35,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-03 23:24:35,487 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-02-03 23:24:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:35,488 INFO L225 Difference]: With dead ends: 369 [2018-02-03 23:24:35,488 INFO L226 Difference]: Without dead ends: 369 [2018-02-03 23:24:35,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2018-02-03 23:24:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-03 23:24:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 339. [2018-02-03 23:24:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-03 23:24:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 385 transitions. [2018-02-03 23:24:35,493 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 385 transitions. Word has length 81 [2018-02-03 23:24:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:35,493 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 385 transitions. [2018-02-03 23:24:35,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-03 23:24:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 385 transitions. [2018-02-03 23:24:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-03 23:24:35,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:35,494 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-03 23:24:35,494 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__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-03 23:24:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 924539713, now seen corresponding path program 1 times [2018-02-03 23:24:35,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:35,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:35,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:35,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:35,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:35,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:35,593 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-03 23:24:35,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:35,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-03 23:24:35,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-03 23:24:35,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-03 23:24:35,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:24:35,594 INFO L87 Difference]: Start difference. First operand 339 states and 385 transitions. Second operand 14 states. [2018-02-03 23:24:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:36,128 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-03 23:24:36,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 23:24:36,128 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-02-03 23:24:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:36,130 INFO L225 Difference]: With dead ends: 382 [2018-02-03 23:24:36,130 INFO L226 Difference]: Without dead ends: 382 [2018-02-03 23:24:36,130 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-03 23:24:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-03 23:24:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 366. [2018-02-03 23:24:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-03 23:24:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 422 transitions. [2018-02-03 23:24:36,135 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 422 transitions. Word has length 85 [2018-02-03 23:24:36,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:36,135 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 422 transitions. [2018-02-03 23:24:36,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-03 23:24:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 422 transitions. [2018-02-03 23:24:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-03 23:24:36,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:36,136 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-03 23:24:36,136 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__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-03 23:24:36,136 INFO L82 PathProgramCache]: Analyzing trace with hash 924539714, now seen corresponding path program 1 times [2018-02-03 23:24:36,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:36,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:36,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:36,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:36,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:36,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:36,538 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-03 23:24:36,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:24:36,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-03 23:24:36,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 23:24:36,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 23:24:36,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-03 23:24:36,540 INFO L87 Difference]: Start difference. First operand 366 states and 422 transitions. Second operand 23 states. [2018-02-03 23:24:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:24:37,954 INFO L93 Difference]: Finished difference Result 397 states and 453 transitions. [2018-02-03 23:24:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-03 23:24:37,955 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-03 23:24:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:24:37,956 INFO L225 Difference]: With dead ends: 397 [2018-02-03 23:24:37,956 INFO L226 Difference]: Without dead ends: 397 [2018-02-03 23:24:37,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1707, Unknown=0, NotChecked=0, Total=2070 [2018-02-03 23:24:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-03 23:24:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 366. [2018-02-03 23:24:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-03 23:24:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 421 transitions. [2018-02-03 23:24:37,962 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 421 transitions. Word has length 85 [2018-02-03 23:24:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:24:37,962 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 421 transitions. [2018-02-03 23:24:37,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 23:24:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 421 transitions. [2018-02-03 23:24:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-03 23:24:37,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:24:37,963 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-03 23:24:37,963 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__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-03 23:24:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039901, now seen corresponding path program 1 times [2018-02-03 23:24:37,964 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:24:37,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:24:37,964 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:37,964 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:37,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:24:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:37,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:24:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 23:24:39,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:24:39,009 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:24:39,014 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:24:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:24:39,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:24:39,068 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-03 23:24:39,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:24:39,109 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-03 23:24:39,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-03 23:24:39,210 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-03 23:24:39,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,212 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-03 23:24:39,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-03 23:24:39,459 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-03 23:24:39,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 10 treesize of output 9 [2018-02-03 23:24:39,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,476 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-03 23:24:39,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-03 23:24:39,546 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-03 23:24:39,548 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-03 23:24:39,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,582 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 34 treesize of output 44 [2018-02-03 23:24:39,586 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 35 treesize of output 34 [2018-02-03 23:24:39,586 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,615 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-03 23:24:39,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:41 [2018-02-03 23:24:39,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:39,848 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:39,848 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-03 23:24:39,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,856 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-03 23:24:39,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:59 [2018-02-03 23:24:39,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:39,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:39,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:39,942 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-03 23:24:39,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:39,950 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-03 23:24:39,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:57 [2018-02-03 23:24:40,010 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 0 case distinctions, treesize of input 58 treesize of output 58 [2018-02-03 23:24:40,012 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-03 23:24:40,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,031 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 40 [2018-02-03 23:24:40,033 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-03 23:24:40,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,045 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-03 23:24:40,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:71 [2018-02-03 23:24:40,110 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 38 treesize of output 47 [2018-02-03 23:24:40,113 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:40,113 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-03 23:24:40,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,142 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 0 case distinctions, treesize of input 67 treesize of output 65 [2018-02-03 23:24:40,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:40,145 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-03 23:24:40,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:40,166 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-03 23:24:40,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:89 [2018-02-03 23:24:41,029 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 41 treesize of output 50 [2018-02-03 23:24:41,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-03 23:24:41,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:41,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:41,044 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-03 23:24:41,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:41,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:41,065 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-03 23:24:41,065 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:108, output treesize:71 [2018-02-03 23:24:41,319 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 59 treesize of output 48 [2018-02-03 23:24:41,322 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-03 23:24:41,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:41,330 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:24:41,330 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 15 treesize of output 11 [2018-02-03 23:24:41,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:41,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:24:41,339 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-03 23:24:41,339 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:24:41,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:24:41,348 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-03 23:24:41,349 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:5 [2018-02-03 23:24:41,411 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-03 23:24:41,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:24:41,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33] total 66 [2018-02-03 23:24:41,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-03 23:24:41,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-03 23:24:41,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4196, Unknown=0, NotChecked=0, Total=4422 [2018-02-03 23:24:41,431 INFO L87 Difference]: Start difference. First operand 366 states and 421 transitions. Second operand 67 states. [2018-02-03 23:25:09,497 WARN L146 SmtUtils]: Spent 4039ms on a formula simplification. DAG size of input: 71 DAG size of output 58 [2018-02-03 23:25:14,947 WARN L146 SmtUtils]: Spent 4059ms on a formula simplification. DAG size of input: 86 DAG size of output 73 [2018-02-03 23:25:19,102 WARN L146 SmtUtils]: Spent 4076ms on a formula simplification. DAG size of input: 93 DAG size of output 80 [2018-02-03 23:25:23,258 WARN L146 SmtUtils]: Spent 4062ms on a formula simplification. DAG size of input: 86 DAG size of output 73 [2018-02-03 23:25:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:25:26,872 INFO L93 Difference]: Finished difference Result 430 states and 482 transitions. [2018-02-03 23:25:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-03 23:25:26,873 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 86 [2018-02-03 23:25:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:25:26,874 INFO L225 Difference]: With dead ends: 430 [2018-02-03 23:25:26,874 INFO L226 Difference]: Without dead ends: 430 [2018-02-03 23:25:26,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3746 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=1282, Invalid=14213, Unknown=5, NotChecked=0, Total=15500 [2018-02-03 23:25:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-02-03 23:25:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 376. [2018-02-03 23:25:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-03 23:25:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 433 transitions. [2018-02-03 23:25:26,879 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 433 transitions. Word has length 86 [2018-02-03 23:25:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:25:26,880 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 433 transitions. [2018-02-03 23:25:26,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-02-03 23:25:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 433 transitions. [2018-02-03 23:25:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-03 23:25:26,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:25:26,880 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-03 23:25:26,880 INFO L371 AbstractCegarLoop]: === Iteration 40 === [__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-03 23:25:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039900, now seen corresponding path program 1 times [2018-02-03 23:25:26,880 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:25:26,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:25:26,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:26,881 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:25:26,881 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:25:26,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:25:28,225 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-03 23:25:28,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:25:28,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2018-02-03 23:25:28,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-03 23:25:28,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-03 23:25:28,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1387, Unknown=0, NotChecked=0, Total=1482 [2018-02-03 23:25:28,226 INFO L87 Difference]: Start difference. First operand 376 states and 433 transitions. Second operand 39 states. [2018-02-03 23:25:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:25:33,152 INFO L93 Difference]: Finished difference Result 433 states and 485 transitions. [2018-02-03 23:25:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-03 23:25:33,152 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 86 [2018-02-03 23:25:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:25:33,153 INFO L225 Difference]: With dead ends: 433 [2018-02-03 23:25:33,153 INFO L226 Difference]: Without dead ends: 433 [2018-02-03 23:25:33,154 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=902, Invalid=8410, Unknown=0, NotChecked=0, Total=9312 [2018-02-03 23:25:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-03 23:25:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 376. [2018-02-03 23:25:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-02-03 23:25:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 432 transitions. [2018-02-03 23:25:33,161 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 432 transitions. Word has length 86 [2018-02-03 23:25:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:25:33,161 INFO L432 AbstractCegarLoop]: Abstraction has 376 states and 432 transitions. [2018-02-03 23:25:33,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-03 23:25:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 432 transitions. [2018-02-03 23:25:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-03 23:25:33,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:25:33,162 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:25:33,162 INFO L371 AbstractCegarLoop]: === Iteration 41 === [__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-03 23:25:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 540132495, now seen corresponding path program 1 times [2018-02-03 23:25:33,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:25:33,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:25:33,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:33,163 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:25:33,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:25:33,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:25:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-03 23:25:34,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:25:34,505 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:25:34,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:25:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:25:34,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:25:34,743 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-03 23:25:34,745 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-03 23:25:34,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:34,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:34,750 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-03 23:25:34,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-02-03 23:25:34,868 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-03 23:25:34,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:34,873 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 7 treesize of output 5 [2018-02-03 23:25:34,873 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 5 treesize of output 3 [2018-02-03 23:25:34,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:34,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:34,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:34,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2018-02-03 23:25:35,026 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-03 23:25:35,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,033 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:35,041 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:12 [2018-02-03 23:25:35,385 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-03 23:25:35,387 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-03 23:25:35,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,402 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-03 23:25:35,404 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-03 23:25:35,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:47 [2018-02-03 23:25:35,486 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 38 treesize of output 34 [2018-02-03 23:25:35,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:35,489 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 31 treesize of output 40 [2018-02-03 23:25:35,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,513 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 36 treesize of output 32 [2018-02-03 23:25:35,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:35,516 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 29 treesize of output 38 [2018-02-03 23:25:35,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-02-03 23:25:35,663 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 45 treesize of output 53 [2018-02-03 23:25:35,666 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 46 treesize of output 51 [2018-02-03 23:25:35,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:35,695 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 39 treesize of output 65 [2018-02-03 23:25:35,695 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-03 23:25:35,745 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-03 23:25:35,767 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 78 treesize of output 71 [2018-02-03 23:25:35,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:35,772 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 0 case distinctions, treesize of input 54 treesize of output 82 [2018-02-03 23:25:35,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,797 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 74 treesize of output 98 [2018-02-03 23:25:35,800 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 87 treesize of output 92 [2018-02-03 23:25:35,801 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:35,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:35,853 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 4 case distinctions, treesize of input 78 treesize of output 106 [2018-02-03 23:25:35,854 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-02-03 23:25:35,903 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:25:35,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-03 23:25:35,950 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:75, output treesize:327 [2018-02-03 23:25:36,411 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-03 23:25:36,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:36,449 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-03 23:25:36,453 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-03 23:25:36,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:36,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:410, output treesize:128 [2018-02-03 23:25:36,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,710 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-03 23:25:36,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:36,732 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 21 treesize of output 17 [2018-02-03 23:25:36,734 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 17 treesize of output 13 [2018-02-03 23:25:36,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:36,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:36,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:36,754 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:140, output treesize:115 [2018-02-03 23:25:36,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,881 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,881 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 26 treesize of output 47 [2018-02-03 23:25:36,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:36,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,903 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,904 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,905 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:36,905 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-02-03 23:25:36,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:36,921 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-03 23:25:36,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:107 [2018-02-03 23:25:37,008 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 74 treesize of output 83 [2018-02-03 23:25:37,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03 23:25:37,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,042 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 83 treesize of output 104 [2018-02-03 23:25:37,044 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-03 23:25:37,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,069 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-03 23:25:37,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:121 [2018-02-03 23:25:37,169 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 92 treesize of output 111 [2018-02-03 23:25:37,171 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:37,172 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-03 23:25:37,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,211 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 83 treesize of output 90 [2018-02-03 23:25:37,213 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:37,242 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-03 23:25:37,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:37,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:147, output treesize:139 [2018-02-03 23:25:37,863 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:25:37,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 122 [2018-02-03 23:25:37,868 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 34 treesize of output 25 [2018-02-03 23:25:37,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,880 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:25:37,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:37,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 81 treesize of output 65 [2018-02-03 23:25:37,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:37,893 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:37,893 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-03 23:25:37,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,900 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-03 23:25:37,917 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-02-03 23:25:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:37,920 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-03 23:25:37,920 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-02-03 23:25:37,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:37,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:37,935 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 33 treesize of output 23 [2018-02-03 23:25:37,935 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,939 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:37,945 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-03 23:25:37,945 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:199, output treesize:16 [2018-02-03 23:25:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-03 23:25:38,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:25:38,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35] total 73 [2018-02-03 23:25:38,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-03 23:25:38,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-03 23:25:38,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=5166, Unknown=0, NotChecked=0, Total=5402 [2018-02-03 23:25:38,245 INFO L87 Difference]: Start difference. First operand 376 states and 432 transitions. Second operand 74 states. [2018-02-03 23:25:39,867 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 136 DAG size of output 92 [2018-02-03 23:25:40,084 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 112 DAG size of output 98 [2018-02-03 23:25:40,265 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 110 DAG size of output 94 [2018-02-03 23:25:47,601 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 126 DAG size of output 103 [2018-02-03 23:25:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:25:55,727 INFO L93 Difference]: Finished difference Result 416 states and 466 transitions. [2018-02-03 23:25:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-03 23:25:55,728 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 102 [2018-02-03 23:25:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:25:55,729 INFO L225 Difference]: With dead ends: 416 [2018-02-03 23:25:55,729 INFO L226 Difference]: Without dead ends: 416 [2018-02-03 23:25:55,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3030 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1262, Invalid=14487, Unknown=1, NotChecked=0, Total=15750 [2018-02-03 23:25:55,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-02-03 23:25:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 373. [2018-02-03 23:25:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-02-03 23:25:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 425 transitions. [2018-02-03 23:25:55,733 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 425 transitions. Word has length 102 [2018-02-03 23:25:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:25:55,733 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 425 transitions. [2018-02-03 23:25:55,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-03 23:25:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 425 transitions. [2018-02-03 23:25:55,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-03 23:25:55,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:25:55,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:25:55,734 INFO L371 AbstractCegarLoop]: === Iteration 42 === [__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-03 23:25:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1592718148, now seen corresponding path program 1 times [2018-02-03 23:25:55,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:25:55,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:25:55,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:55,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:25:55,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:25:55,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:25:55,799 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-03 23:25:55,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:25:55,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:25:55,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:25:55,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:25:55,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:25:55,800 INFO L87 Difference]: Start difference. First operand 373 states and 425 transitions. Second operand 7 states. [2018-02-03 23:25:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:25:56,018 INFO L93 Difference]: Finished difference Result 372 states and 424 transitions. [2018-02-03 23:25:56,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:25:56,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-02-03 23:25:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:25:56,019 INFO L225 Difference]: With dead ends: 372 [2018-02-03 23:25:56,019 INFO L226 Difference]: Without dead ends: 372 [2018-02-03 23:25:56,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:25:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-02-03 23:25:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-02-03 23:25:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-02-03 23:25:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 424 transitions. [2018-02-03 23:25:56,025 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 424 transitions. Word has length 92 [2018-02-03 23:25:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:25:56,025 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 424 transitions. [2018-02-03 23:25:56,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:25:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 424 transitions. [2018-02-03 23:25:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-03 23:25:56,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:25:56,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:25:56,026 INFO L371 AbstractCegarLoop]: === Iteration 43 === [__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-03 23:25:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1592718147, now seen corresponding path program 1 times [2018-02-03 23:25:56,026 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:25:56,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:25:56,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:56,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:25:56,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:25:56,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:25:56,108 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-03 23:25:56,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:25:56,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:25:56,108 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:25:56,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:25:56,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:25:56,108 INFO L87 Difference]: Start difference. First operand 372 states and 424 transitions. Second operand 7 states. [2018-02-03 23:25:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:25:56,275 INFO L93 Difference]: Finished difference Result 371 states and 423 transitions. [2018-02-03 23:25:56,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:25:56,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-02-03 23:25:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:25:56,276 INFO L225 Difference]: With dead ends: 371 [2018-02-03 23:25:56,276 INFO L226 Difference]: Without dead ends: 371 [2018-02-03 23:25:56,276 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-03 23:25:56,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-03 23:25:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-02-03 23:25:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-02-03 23:25:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2018-02-03 23:25:56,279 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 92 [2018-02-03 23:25:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:25:56,279 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2018-02-03 23:25:56,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:25:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2018-02-03 23:25:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-03 23:25:56,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:25:56,280 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, 1, 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-03 23:25:56,280 INFO L371 AbstractCegarLoop]: === Iteration 44 === [__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-03 23:25:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2132545757, now seen corresponding path program 1 times [2018-02-03 23:25:56,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:25:56,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:25:56,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:56,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:25:56,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:25:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:25:56,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:25:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 23:25:56,837 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:25:56,837 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:25:56,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:25:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:25:56,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:25:57,051 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-03 23:25:57,052 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-03 23:25:57,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,057 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-03 23:25:57,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-03 23:25:57,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:25:57,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:35 [2018-02-03 23:25:57,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2018-02-03 23:25:57,309 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 16 [2018-02-03 23:25:57,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 23:25:57,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03 23:25:57,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,341 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:45 [2018-02-03 23:25:57,389 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-03 23:25:57,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,391 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-03 23:25:57,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,414 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,416 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 35 treesize of output 51 [2018-02-03 23:25:57,419 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:57,431 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-02-03 23:25:57,432 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-03 23:25:57,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:57,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2018-02-03 23:25:58,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,112 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 71 [2018-02-03 23:25:58,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,123 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 67 treesize of output 81 [2018-02-03 23:25:58,124 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:25:58,156 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 47 treesize of output 36 [2018-02-03 23:25:58,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:58,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,184 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 43 treesize of output 40 [2018-02-03 23:25:58,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:58,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-02-03 23:25:58,215 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:58,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:25:58,245 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-03 23:25:58,245 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:111, output treesize:75 [2018-02-03 23:25:58,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,498 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 32 treesize of output 32 [2018-02-03 23:25:58,506 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-03 23:25:58,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:58,510 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 14 treesize of output 10 [2018-02-03 23:25:58,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:58,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:58,520 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-03 23:25:58,520 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-02-03 23:25:58,654 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_list_move_~head.base_BEFORE_CALL_1 Int) (v_arrayElimCell_66 Int)) (and (not (= v_list_move_~head.base_BEFORE_CALL_1 v_arrayElimCell_66)) (= (select |c_#valid| v_arrayElimCell_66) 1) (= (select |c_#valid| v_list_move_~head.base_BEFORE_CALL_1) 1))) (exists ((__list_del_~next.offset Int) (__list_del_~prev.offset Int) (__list_del_~prev.base Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |c___list_del_#in~next.base| (store (select |c_old(#memory_$Pointer$.base)| |c___list_del_#in~next.base|) (+ __list_del_~next.offset 4) __list_del_~prev.base)))) (store .cse0 __list_del_~prev.base (store (select .cse0 __list_del_~prev.base) __list_del_~prev.offset |c___list_del_#in~next.base|)))))) is different from true [2018-02-03 23:25:58,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 83 [2018-02-03 23:25:58,700 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 81 treesize of output 80 [2018-02-03 23:25:58,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:58,754 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 2 case distinctions, treesize of input 54 treesize of output 57 [2018-02-03 23:25:58,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 23:25:58,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:58,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 106 [2018-02-03 23:25:58,842 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-03 23:25:58,851 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 88 treesize of output 87 [2018-02-03 23:25:58,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:59,005 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:59,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:59,095 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 4 case distinctions, treesize of input 63 treesize of output 82 [2018-02-03 23:25:59,096 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-03 23:25:59,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 64 [2018-02-03 23:25:59,183 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-03 23:25:59,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:25:59,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:59,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:59,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 105 [2018-02-03 23:25:59,468 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-02-03 23:25:59,505 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:25:59,692 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 57 treesize of output 56 [2018-02-03 23:25:59,692 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-03 23:25:59,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:25:59,791 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 4 case distinctions, treesize of input 60 treesize of output 79 [2018-02-03 23:25:59,792 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-02-03 23:25:59,876 INFO L267 ElimStorePlain]: Start of recursive call 10: 7 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:25:59,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 74 [2018-02-03 23:25:59,974 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-03 23:25:59,974 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-02-03 23:26:00,118 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:00,157 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 4 case distinctions, treesize of input 45 treesize of output 56 [2018-02-03 23:26:00,158 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-02-03 23:26:00,191 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 23:26:00,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-02-03 23:26:00,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 29 dim-0 vars, and 6 xjuncts. [2018-02-03 23:26:00,311 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:111, output treesize:497 [2018-02-03 23:26:00,885 WARN L146 SmtUtils]: Spent 428ms on a formula simplification. DAG size of input: 200 DAG size of output 140 [2018-02-03 23:26:01,237 WARN L143 SmtUtils]: Spent 222ms on a formula simplification that was a NOOP. DAG size: 140 [2018-02-03 23:26:01,619 WARN L143 SmtUtils]: Spent 264ms on a formula simplification that was a NOOP. DAG size: 140 [2018-02-03 23:26:01,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:01,627 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-02-03 23:26:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:01,638 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 36 [2018-02-03 23:26:01,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:26:01,653 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-03 23:26:01,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:01,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:01,720 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:01,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:01,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 99 [2018-02-03 23:26:01,772 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 95 [2018-02-03 23:26:01,774 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-02-03 23:26:02,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-02-03 23:26:02,184 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:02,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:02,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:02,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:02,445 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 3 case distinctions, treesize of input 65 treesize of output 88 [2018-02-03 23:26:02,446 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-02-03 23:26:02,789 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 2 case distinctions, treesize of input 68 treesize of output 70 [2018-02-03 23:26:02,790 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:02,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:02,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2018-02-03 23:26:02,797 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:02,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 66 [2018-02-03 23:26:02,811 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:02,813 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 52 treesize of output 40 [2018-02-03 23:26:02,813 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:03,133 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 75 treesize of output 67 [2018-02-03 23:26:03,133 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:03,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 64 [2018-02-03 23:26:03,390 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:03,604 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 1 case distinctions, treesize of input 73 treesize of output 70 [2018-02-03 23:26:03,605 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:03,838 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 67 treesize of output 55 [2018-02-03 23:26:03,838 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:04,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:04,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:04,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:04,047 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 57 treesize of output 52 [2018-02-03 23:26:04,047 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:04,288 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 46 treesize of output 40 [2018-02-03 23:26:04,289 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:04,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 59 [2018-02-03 23:26:04,502 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-03 23:26:04,765 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 46 treesize of output 40 [2018-02-03 23:26:04,766 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:05,014 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 50 treesize of output 46 [2018-02-03 23:26:05,015 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:05,258 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 50 treesize of output 44 [2018-02-03 23:26:05,259 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:05,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2018-02-03 23:26:05,504 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:05,758 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 67 [2018-02-03 23:26:05,760 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-03 23:26:06,053 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 46 treesize of output 34 [2018-02-03 23:26:06,053 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:06,325 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 44 treesize of output 32 [2018-02-03 23:26:06,326 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:06,591 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 57 treesize of output 45 [2018-02-03 23:26:06,591 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-02-03 23:26:06,879 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:07,146 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 38 treesize of output 32 [2018-02-03 23:26:07,146 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:07,404 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 60 treesize of output 52 [2018-02-03 23:26:07,404 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:07,660 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 44 treesize of output 32 [2018-02-03 23:26:07,661 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:07,943 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 46 treesize of output 34 [2018-02-03 23:26:07,943 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:07,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-02-03 23:26:07,946 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:07,948 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 46 treesize of output 34 [2018-02-03 23:26:07,948 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:07,957 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 40 treesize of output 28 [2018-02-03 23:26:07,957 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:08,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 69 treesize of output 60 [2018-02-03 23:26:08,187 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:08,409 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 50 treesize of output 42 [2018-02-03 23:26:08,409 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:08,629 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 65 treesize of output 53 [2018-02-03 23:26:08,629 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:08,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 59 [2018-02-03 23:26:08,860 INFO L267 ElimStorePlain]: Start of recursive call 39: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-03 23:26:09,115 INFO L267 ElimStorePlain]: Start of recursive call 5: 28 dim-1 vars, End of recursive call: 23 dim-0 vars, and 23 xjuncts. [2018-02-03 23:26:09,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 62 [2018-02-03 23:26:09,501 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 53 treesize of output 48 [2018-02-03 23:26:09,501 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:09,540 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 48 treesize of output 44 [2018-02-03 23:26:09,541 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:09,577 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 47 treesize of output 45 [2018-02-03 23:26:09,577 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:09,613 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 47 treesize of output 35 [2018-02-03 23:26:09,613 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:09,646 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 36 treesize of output 24 [2018-02-03 23:26:09,646 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:09,670 INFO L267 ElimStorePlain]: Start of recursive call 40: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:10,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 86 [2018-02-03 23:26:10,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-02-03 23:26:10,046 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:10,067 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 57 treesize of output 46 [2018-02-03 23:26:10,067 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:10,084 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 58 treesize of output 46 [2018-02-03 23:26:10,085 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:10,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 46 treesize of output 29 [2018-02-03 23:26:10,101 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:10,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-02-03 23:26:10,117 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:10,132 INFO L267 ElimStorePlain]: Start of recursive call 46: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:26:10,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:10,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:10,504 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 86 [2018-02-03 23:26:10,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2018-02-03 23:26:10,507 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:10,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-02-03 23:26:10,529 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:10,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-02-03 23:26:10,554 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:10,572 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:10,572 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 62 treesize of output 46 [2018-02-03 23:26:10,573 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:10,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-02-03 23:26:10,589 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:10,603 INFO L267 ElimStorePlain]: Start of recursive call 52: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:26:11,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 47 [2018-02-03 23:26:11,027 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 31 treesize of output 17 [2018-02-03 23:26:11,027 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:11,033 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 14 treesize of output 10 [2018-02-03 23:26:11,033 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:11,038 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:11,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 6 dim-2 vars, End of recursive call: 30 dim-0 vars, and 30 xjuncts. [2018-02-03 23:26:11,418 INFO L202 ElimStorePlain]: Needed 60 recursive calls to eliminate 25 variables, input treesize:523, output treesize:451 [2018-02-03 23:26:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:26:11,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:26:11,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 40] total 69 [2018-02-03 23:26:11,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-02-03 23:26:11,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-02-03 23:26:11,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=4377, Unknown=2, NotChecked=134, Total=4830 [2018-02-03 23:26:11,761 INFO L87 Difference]: Start difference. First operand 371 states and 423 transitions. Second operand 70 states. [2018-02-03 23:26:15,288 WARN L146 SmtUtils]: Spent 485ms on a formula simplification. DAG size of input: 150 DAG size of output 146 [2018-02-03 23:26:37,264 WARN L146 SmtUtils]: Spent 21907ms on a formula simplification. DAG size of input: 162 DAG size of output 148 [2018-02-03 23:26:44,632 WARN L146 SmtUtils]: Spent 7274ms on a formula simplification. DAG size of input: 210 DAG size of output 155 [2018-02-03 23:26:44,899 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 220 DAG size of output 158 [2018-02-03 23:26:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:26:47,799 INFO L93 Difference]: Finished difference Result 436 states and 487 transitions. [2018-02-03 23:26:47,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-03 23:26:47,800 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 95 [2018-02-03 23:26:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:26:47,801 INFO L225 Difference]: With dead ends: 436 [2018-02-03 23:26:47,801 INFO L226 Difference]: Without dead ends: 436 [2018-02-03 23:26:47,802 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5042 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=1409, Invalid=15333, Unknown=32, NotChecked=256, Total=17030 [2018-02-03 23:26:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-02-03 23:26:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 395. [2018-02-03 23:26:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-02-03 23:26:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 461 transitions. [2018-02-03 23:26:47,806 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 461 transitions. Word has length 95 [2018-02-03 23:26:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:26:47,807 INFO L432 AbstractCegarLoop]: Abstraction has 395 states and 461 transitions. [2018-02-03 23:26:47,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-02-03 23:26:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 461 transitions. [2018-02-03 23:26:47,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-03 23:26:47,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:26:47,807 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, 1, 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-03 23:26:47,807 INFO L371 AbstractCegarLoop]: === Iteration 45 === [__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-03 23:26:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2132545758, now seen corresponding path program 1 times [2018-02-03 23:26:47,807 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:26:47,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:26:47,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:26:47,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:26:47,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:26:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:26:47,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:26:48,959 WARN L146 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 113 DAG size of output 69 [2018-02-03 23:26:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-03 23:26:49,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:26:49,164 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:26:49,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:26:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:26:49,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:26:49,212 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-03 23:26:49,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:26:49,219 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-03 23:26:49,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-03 23:26:49,336 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-03 23:26:49,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,338 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-03 23:26:49,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-03 23:26:49,537 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-03 23:26:49,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:26:49,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,547 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-03 23:26:49,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-03 23:26:49,592 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-03 23:26:49,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-03 23:26:49,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,611 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 34 treesize of output 44 [2018-02-03 23:26:49,613 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 35 treesize of output 34 [2018-02-03 23:26:49,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,640 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-03 23:26:49,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:38 [2018-02-03 23:26:49,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:49,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:49,811 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-03 23:26:49,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,829 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-03 23:26:49,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:64 [2018-02-03 23:26:49,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:49,943 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:49,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:49,944 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-03 23:26:49,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:49,953 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-03 23:26:49,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:65 [2018-02-03 23:26:50,015 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,016 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 60 treesize of output 69 [2018-02-03 23:26:50,017 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 18 treesize of output 16 [2018-02-03 23:26:50,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:50,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:50,040 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,043 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 31 treesize of output 61 [2018-02-03 23:26:50,045 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 28 treesize of output 26 [2018-02-03 23:26:50,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:50,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:50,060 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-03 23:26:50,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:75 [2018-02-03 23:26:50,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,130 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 69 treesize of output 84 [2018-02-03 23:26:50,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,140 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 3 case distinctions, treesize of input 33 treesize of output 52 [2018-02-03 23:26:50,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:26:50,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:50,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,179 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,179 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 40 treesize of output 86 [2018-02-03 23:26:50,183 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:50,190 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 72 [2018-02-03 23:26:50,190 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-03 23:26:50,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:50,218 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-03 23:26:50,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:100 [2018-02-03 23:26:51,750 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,756 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 118 [2018-02-03 23:26:51,775 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 129 [2018-02-03 23:26:51,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-02-03 23:26:51,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,990 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 93 treesize of output 83 [2018-02-03 23:26:51,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:51,993 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,993 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 89 treesize of output 79 [2018-02-03 23:26:51,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:51,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,995 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 83 treesize of output 73 [2018-02-03 23:26:51,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:51,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:51,998 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 77 treesize of output 67 [2018-02-03 23:26:51,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,000 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,001 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 83 treesize of output 73 [2018-02-03 23:26:52,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,003 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 93 treesize of output 83 [2018-02-03 23:26:52,004 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,006 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 93 treesize of output 83 [2018-02-03 23:26:52,006 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,150 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 73 [2018-02-03 23:26:52,150 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,152 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 63 treesize of output 53 [2018-02-03 23:26:52,153 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,163 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 67 [2018-02-03 23:26:52,164 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,165 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 57 treesize of output 47 [2018-02-03 23:26:52,165 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,176 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 77 [2018-02-03 23:26:52,177 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 77 [2018-02-03 23:26:52,188 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 69 [2018-02-03 23:26:52,195 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,343 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 47 treesize of output 37 [2018-02-03 23:26:52,343 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,357 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 57 [2018-02-03 23:26:52,357 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,371 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 61 [2018-02-03 23:26:52,371 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-02-03 23:26:52,373 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 61 [2018-02-03 23:26:52,387 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,399 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 57 [2018-02-03 23:26:52,400 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2018-02-03 23:26:52,406 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-02-03 23:26:52,518 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 70 treesize of output 64 [2018-02-03 23:26:52,519 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:26:52,603 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 64 treesize of output 52 [2018-02-03 23:26:52,603 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,673 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 52 treesize of output 42 [2018-02-03 23:26:52,674 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-02-03 23:26:52,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,815 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,816 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:26:52,828 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-03 23:26:52,828 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:26:52,841 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,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 7 treesize of output 1 [2018-02-03 23:26:52,851 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,860 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 11 treesize of output 1 [2018-02-03 23:26:52,860 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,865 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:26:52,884 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 48 [2018-02-03 23:26:52,885 INFO L267 ElimStorePlain]: Start of recursive call 34: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-02-03 23:26:52,905 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 11 treesize of output 1 [2018-02-03 23:26:52,905 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,914 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 7 treesize of output 1 [2018-02-03 23:26:52,914 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,922 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 11 treesize of output 1 [2018-02-03 23:26:52,922 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,927 INFO L267 ElimStorePlain]: Start of recursive call 33: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:26:52,935 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 7 treesize of output 1 [2018-02-03 23:26:52,936 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,949 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 11 treesize of output 1 [2018-02-03 23:26:52,949 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:26:52,959 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,967 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 11 treesize of output 1 [2018-02-03 23:26:52,967 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,973 INFO L267 ElimStorePlain]: Start of recursive call 38: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:52,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,975 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,976 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:52,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:26:52,989 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-03 23:26:52,989 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,002 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 7 treesize of output 1 [2018-02-03 23:26:53,002 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,014 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 7 treesize of output 1 [2018-02-03 23:26:53,014 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,025 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 11 treesize of output 1 [2018-02-03 23:26:53,025 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,031 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,039 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:26:53,063 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 48 [2018-02-03 23:26:53,064 INFO L267 ElimStorePlain]: Start of recursive call 49: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-02-03 23:26:53,087 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 11 treesize of output 1 [2018-02-03 23:26:53,087 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,098 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 11 treesize of output 1 [2018-02-03 23:26:53,098 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,111 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 7 treesize of output 1 [2018-02-03 23:26:53,111 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,117 INFO L267 ElimStorePlain]: Start of recursive call 48: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:26:53,137 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-03 23:26:53,137 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,151 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 7 treesize of output 1 [2018-02-03 23:26:53,152 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,163 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 7 treesize of output 1 [2018-02-03 23:26:53,163 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,172 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 11 treesize of output 1 [2018-02-03 23:26:53,172 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,178 INFO L267 ElimStorePlain]: Start of recursive call 53: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,181 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,182 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2018-02-03 23:26:53,195 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-03 23:26:53,196 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,209 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 7 treesize of output 1 [2018-02-03 23:26:53,209 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,221 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 11 treesize of output 1 [2018-02-03 23:26:53,221 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,230 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 7 treesize of output 1 [2018-02-03 23:26:53,230 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,236 INFO L267 ElimStorePlain]: Start of recursive call 58: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,238 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,241 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 60 treesize of output 48 [2018-02-03 23:26:53,242 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 7 treesize of output 1 [2018-02-03 23:26:53,243 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,253 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 7 treesize of output 1 [2018-02-03 23:26:53,253 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,261 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 11 treesize of output 1 [2018-02-03 23:26:53,261 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,265 INFO L267 ElimStorePlain]: Start of recursive call 63: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:26:53,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 23:26:53,320 INFO L202 ElimStorePlain]: Needed 66 recursive calls to eliminate 6 variables, input treesize:165, output treesize:34 [2018-02-03 23:26:53,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 429 treesize of output 410 [2018-02-03 23:26:53,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,736 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 417 treesize of output 497 [2018-02-03 23:26:53,739 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-02-03 23:26:53,862 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,864 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:26:53,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,870 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 375 [2018-02-03 23:26:53,891 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:26:53,902 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:26:53,939 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 380 treesize of output 399 [2018-02-03 23:26:53,939 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-02-03 23:26:54,100 INFO L267 ElimStorePlain]: Start of recursive call 5: 123 dim-0 vars, End of recursive call: 123 dim-0 vars, and 82 xjuncts. Received shutdown request... [2018-02-03 23:27:13,902 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 23:27:13,903 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:27:13,906 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:27:13,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:27:13 BoogieIcfgContainer [2018-02-03 23:27:13,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:27:13,907 INFO L168 Benchmark]: Toolchain (without parser) took 187443.55 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 814.2 MB). Free memory was 354.4 MB in the beginning and 536.4 MB in the end (delta: -182.0 MB). Peak memory consumption was 632.2 MB. Max. memory is 5.3 GB. [2018-02-03 23:27:13,908 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.9 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:27:13,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.95 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 341.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:27:13,908 INFO L168 Benchmark]: Boogie Preprocessor took 35.90 ms. Allocated memory is still 397.9 MB. Free memory is still 341.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:27:13,908 INFO L168 Benchmark]: RCFGBuilder took 431.30 ms. Allocated memory is still 397.9 MB. Free memory was 338.5 MB in the beginning and 294.8 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:27:13,908 INFO L168 Benchmark]: TraceAbstraction took 186806.88 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 814.2 MB). Free memory was 294.8 MB in the beginning and 536.4 MB in the end (delta: -241.6 MB). Peak memory consumption was 572.7 MB. Max. memory is 5.3 GB. [2018-02-03 23:27:13,909 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.13 ms. Allocated memory is still 397.9 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.95 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 341.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.90 ms. Allocated memory is still 397.9 MB. Free memory is still 341.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 431.30 ms. Allocated memory is still 397.9 MB. Free memory was 338.5 MB in the beginning and 294.8 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 186806.88 ms. Allocated memory was 397.9 MB in the beginning and 1.2 GB in the end (delta: 814.2 MB). Free memory was 294.8 MB in the beginning and 536.4 MB in the end (delta: -241.6 MB). Peak memory consumption was 572.7 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 analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 714). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 96 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3297. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 179 locations, 55 error locations. TIMEOUT Result, 186.7s OverallTime, 45 OverallIterations, 2 TraceHistogramMax, 126.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5900 SDtfs, 10837 SDslu, 32835 SDs, 0 SdLazy, 65902 SolverSat, 3288 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 45.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 471 SyntacticMatches, 41 SemanticMatches, 1268 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19328 ImplicationChecksByTransitivity, 91.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=44, 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.2s AutomataMinimizationTime, 44 MinimizatonAttempts, 1069 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 32.2s InterpolantComputationTime, 2881 NumberOfCodeBlocks, 2881 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 2831 ConstructedInterpolants, 200 QuantifiedInterpolants, 3337530 SizeOfPredicates, 180 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 551 ConjunctsInUnsatCore, 50 InterpolantComputations, 39 PerfectInterpolantSequences, 216/288 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-27-13-915.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-27-13-915.csv Completed graceful shutdown